Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A141212
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A141212 a(n) = 1, if n == {1,3,4} mod 6; otherwise 0. +0
1
1, 0, 1, 1, 0, 0, 1, 0, 1, 1, 0, 0, 1, 0, 1, 1, 0, 0, 1, 0, 1, 1, 0, 0, 1, 0, 1, 1, 0, 0, 1, 0, 1 (list; graph; listen)
OFFSET

1,1

FORMULA

a(n) = 1 if n == {1,3,4} mod 6; otherwise 0; where A029739(n) = {1,3,4} mod 6: 1, 3, 4, 7, 9, 10, 13,... Begin with the sequence S: (1,0,1,0,1,0,...) and create a hole every 3n-th place: 1,0_1,0_1,0_1,0_,... Then insert terms of the sequence S in the holes.

O.g.f.: x(1+x^2+x^3)/((1-x)(1+x)(x^2+x+1)(x^2-x+1)). a(n)= 1/2+A049347(n-1)/2-(-1)^n/6-A087204(n)/6 = a(n-6). - R. J. Mathar (mathar(AT)strw.leidenuniv.nl), Jun 17 2008

EXAMPLE

a(7) = 1 since 7 == 1 mod 6.

CROSSREFS

Cf. A029739.

Sequence in context: A118174 A156258 A132138 this_sequence A137893 A108882 A168002

Adjacent sequences: A141209 A141210 A141211 this_sequence A141213 A141214 A141215

KEYWORD

nonn

AUTHOR

Gary W. Adamson (qntmpkt(AT)yahoo.com), Jun 14 2008

page 1

Search completed in 0.002 seconds

Lookup | Welcome | Find friends | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Transforms | Puzzles | Hot | Classics
More pages | Superseeker | The OEIS Foundation | Maintained by N. J. A. Sloane (njas@research.att.com)

Last modified March 15 12:29 EDT 2010. Contains 173428 sequences.


AT&T Labs Research