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

 

Logo

Annual Appeal: Please make a donation (tax deductible in USA) to keep the OEIS running. Over 5000 articles have referenced us, often saying "we discovered this result with the help of the OEIS".

Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A137934 Period 6: 2,2,2,2,2,0. 0
2, 2, 2, 2, 2, 0, 2, 2, 2, 2, 2, 0, 2, 2, 2, 2, 2, 0, 2, 2, 2, 2, 2, 0, 2, 2, 2, 2, 2, 0, 2, 2, 2, 2, 2, 0, 2, 2, 2, 2, 2, 0, 2, 2, 2, 2, 2, 0, 2, 2, 2, 2, 2, 0, 2, 2, 2, 2, 2, 0, 2, 2, 2, 2, 2, 0, 2, 2, 2, 2, 2, 0, 2, 2, 2, 2, 2, 0, 2, 2, 2, 2, 2, 0, 2, 2, 2, 2, 2, 0, 2, 2, 2, 2, 2, 0, 2, 2, 2, 2, 2, 0, 2, 2, 2, 2, 2, 0, 2, 2, 2, 2, 2, 0 (list; graph; refs; listen; history; text; internal format)
OFFSET

1,1

LINKS

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

Index entries for linear recurrences with constant coefficients, signature (0,0,0,0,0,1).

FORMULA

a(n) = LCM[GCD(n%2,n%3),2] where x%y == mod(x,y).

O.g.f.: -2*x*(1+x+x^2+x^3+x^4)/[(x-1)(x+1)(x^2+x+1)(x^2-x+1)] . a(n)=2*A097325(n). - R. J. Mathar, Mar 06 2008

a(n)=(1/9)*{-2*(n mod 6)+4*[(n+1) mod 6]+[(n+2) mod 6]+[(n+3) mod 6]+[(n+4) mod 6]+[(n+5) mod 6]} - Paolo P. Lava, Apr 22 2008

PROG

(PARI) a(n)=if(n%6, 2, 0) \\ Charles R Greathouse IV, Jul 13 2016

CROSSREFS

Sequence in context: A037868 A173069 A059963 * A133738 A240713 A111409

Adjacent sequences:  A137931 A137932 A137933 * A137935 A137936 A137937

KEYWORD

nonn,easy

AUTHOR

William A. Tedeschi, Feb 29 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 December 5 05:27 EST 2016. Contains 278761 sequences.