|
| |
|
|
A141212
|
|
a(n) = 1, if n == {1,3,4} mod 6; otherwise 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, 1, 0, 0, 1, 0, 1
(list; graph; refs; listen; history; internal format)
|
|
|
|
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
a(n)= ((Fibonacci(n+4) mod 4) mod 3)mod 2 [From Gary Detlefs (gdetlefs(AT)aol.com), Dec 29 2010]
|
|
|
EXAMPLE
| a(7) = 1 since 7 == 1 mod 6.
|
|
|
CROSSREFS
| Cf. A029739.
Sequence in context: A118174 A156258 A132138 * A137893 A108882 A168002
Adjacent sequences: A141209 A141210 A141211 * A141213 A141214 A141215
|
|
|
KEYWORD
| nonn
|
|
|
AUTHOR
| Gary W. Adamson (qntmpkt(AT)yahoo.com), Jun 14 2008
|
| |
|
|
