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

%I

%S 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,

%T 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,

%U 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

%N n modulo 3 repeated 3 times.

%C Periodic with length 3^2=9.

%F G.f.: (1 + 2*x^3)*(1 - x^3)/((1 - x)*(1 - x^9)).

%F a(n) = (1 + floor(n/3)) mod 3.

%F a(n) = A010872(A002264(n+3)).

%F a(n) = 1+floor(n/3)-3*floor((n+3)/9).

%F a(n) = (((n+3) mod 9)-(n mod 3))/3.

%F a(n) = ((n+3-(n mod 3))/3) mod 3.

%F a(n) = binomial(n+3,n) mod 3 = binomial(n+3,3) mod 3.

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

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

%K nonn,easy

%O 0,4

%A _Hieronymus Fischer_, Oct 10 2007

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 November 11 22:31 EST 2019. Contains 329046 sequences. (Running on oeis4.)