id:A133880 - OEIS Search Results

Search: id:A133880

Displaying 1-1 of 1 results found.

page 1

n modulo p repeated p times (where p=10).

+0
47

1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 1, 1, 1, 1 (list; graph; listen)

	OFFSET	`0,11`
	COMMENT	`Periodic with length p^2=100.`
	FORMULA	`The following formulas are given for a general parameter p (p=10 for this sequence).` `a(n)=(1+floor(n/p)) mod p.` `a(n)=1+floor(n/p)-pfloor((n+p)/p^2).` `a(n)=(((n+p) mod p^2)-(n mod p))/p.` `a(n)=((n+p-(n mod p))/p) mod p.` `G.f. g(x)=((p-1)x^(p^2)-px^(p(p-1))+1)/((1-x)(1-x^p)(1-x^(p^2))).` `G.f. g(x)=(1-x^p)sum{0<=k<(p-1), (k+1)x^(kp)}/((1-x)(1-x^(p^2))).`
	CROSSREFS	`Cf. A000040, A133620-A133625, A133630, A133633-A133636.` `Cf. A133890, A133900, A133910.` `Sequence in context: A111853 A111851 A111852 this_sequence A059995 A132272 A054899` `Adjacent sequences: A133877 A133878 A133879 this_sequence A133881 A133882 A133883`
	KEYWORD	`nonn`
	AUTHOR	`Hieronymus Fischer (Hieronymus.Fischer(AT)gmx.de), Oct 10 2007`

page 1

Search completed in 0.002 seconds

Last modified July 23 10:48 EDT 2008. Contains 142285 sequences.

AT&T Labs Research