login
The OEIS is supported by the many generous donors to the OEIS Foundation.

 

Logo
Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A133873 n modulo 3 repeated 3 times. 5
1, 1, 1, 2, 2, 2, 0, 0, 0, 1, 1, 1, 2, 2, 2, 0, 0, 0, 1, 1, 1, 2, 2, 2, 0, 0, 0, 1, 1, 1, 2, 2, 2, 0, 0, 0, 1, 1, 1, 2, 2, 2, 0, 0, 0, 1, 1, 1, 2, 2, 2, 0, 0, 0, 1, 1, 1, 2, 2, 2, 0, 0, 0, 1, 1, 1, 2, 2, 2, 0, 0, 0, 1, 1, 1, 2, 2, 2, 0, 0, 0, 1, 1, 1, 2, 2, 2, 0, 0, 0, 1, 1, 1, 2, 2, 2, 0, 0, 0, 1, 1, 1, 2, 2, 2 (list; graph; refs; listen; history; text; internal format)
OFFSET
0,4
COMMENTS
Periodic with length 3^2=9.
LINKS
FORMULA
G.f.: (1 + 2*x^3)*(1 - x^3)/((1 - x)*(1 - x^9)).
a(n) = (1 + floor(n/3)) mod 3.
a(n) = A010872(A002264(n+3)).
a(n) = 1+floor(n/3)-3*floor((n+3)/9).
a(n) = (((n+3) mod 9)-(n mod 3))/3.
a(n) = ((n+3-(n mod 3))/3) mod 3.
a(n) = binomial(n+3,n) mod 3 = binomial(n+3,3) mod 3.
CROSSREFS
Sequence in context: A132784 A180834 A214458 * A163326 A028953 A348648
KEYWORD
nonn,easy
AUTHOR
Hieronymus Fischer, Oct 10 2007
STATUS
approved

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

License Agreements, Terms of Use, Privacy Policy. .

Last modified April 23 03:30 EDT 2024. Contains 371906 sequences. (Running on oeis4.)