login
This site is supported by donations to The OEIS Foundation.

 

Logo


Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
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; text; internal format)
OFFSET

1,1

LINKS

Table of n, a(n) for n=1..33.

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, Jun 17 2008

a(n)= ((Fibonacci(n+4) mod 4) mod 3)mod 2 [From Gary Detlefs, Dec 29 2010]

EXAMPLE

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

MATHEMATICA

Table[If[MemberQ[{1, 3, 4}, Mod[n, 6]], 1, 0], {n, 120}] (* or *) PadRight[{}, 120, {1, 0, 1, 1, 0, 0}] (* Harvey P. Dale, May 03 2013 *)

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, Jun 14 2008

STATUS

approved

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Style Sheet | Transforms | Superseeker | Recent | More pages
The OEIS Community | Maintained by The OEIS Foundation Inc.

License Agreements, Terms of Use, Privacy Policy .

Last modified September 21 15:33 EDT 2017. Contains 292312 sequences.