id:A133873 - OEIS Search Results

Search: id:A133873

Displaying 1-1 of 1 results found.

page 1

n modulo 3 repeated 3 times.

+0
6

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; listen)

	OFFSET	`0,4`
	COMMENT	`Periodic with length 3^2=9.`
	FORMULA	`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.` `G.f. g(x)=(1+x+x^2+2x^3+2x^4+2x^5)/(1-x^9).` `G.f. g(x)=((1+2x^3)(1-x^3))/((1-x)(1-x^9)).`
	CROSSREFS	`Cf. A000040, A133620-A133625, A133630, A133633-A133636.` `Cf. A133883, A133880, A133890, A133900, A133910.` `Sequence in context: A076953 A093315 A132784 this_sequence A028953 A037865 A039969` `Adjacent sequences: A133870 A133871 A133872 this_sequence A133874 A133875 A133876`
	KEYWORD	`nonn`
	AUTHOR	`Hieronymus Fischer (Hieronymus.Fischer(AT)gmx.de), Oct 10 2007`

page 1

Search completed in 0.002 seconds

Last modified December 4 21:35 EST 2008. Contains 151309 sequences.

AT&T Labs Research