login
This site is supported by donations 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

Table of n, a(n) for n=0..104.

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

Cf. A000040, A133620-A133625, A133630, A038509, A133634-A133636.

Cf. A133883, A133880, A133890, A133900, A133910.

Sequence in context: A132784 A180834 A214458 * A163326 A028953 A037865

Adjacent sequences:  A133870 A133871 A133872 * A133874 A133875 A133876

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 | Recent
The OEIS Community | Maintained by The OEIS Foundation Inc.

License Agreements, Terms of Use, Privacy Policy. .

Last modified October 17 16:51 EDT 2019. Contains 328120 sequences. (Running on oeis4.)