id:A133620 - OEIS Search Results

Search: id:A133620

Displaying 1-1 of 1 results found.

page 1

Binomial(n+p,n) mod n where p=10.

+0
75

0, 0, 1, 1, 3, 4, 2, 6, 2, 6, 1, 2, 1, 10, 5, 7, 1, 12, 1, 15, 18, 12, 1, 12, 21, 14, 4, 12, 1, 28, 1, 29, 1, 18, 6, 5, 1, 20, 14, 10, 1, 14, 1, 34, 15, 24, 1, 3, 8, 16, 18, 27, 1, 34, 23, 16, 1, 30, 1, 16, 1, 32, 17, 57, 40, 56, 1, 1, 47, 60, 1, 54, 1, 38, 36, 58, 12, 66, 1, 63, 10, 42, 1 (list; graph; listen)

	OFFSET	`1,5`
	COMMENT	`Let d(m)...d(2)d(1)d(0) be the base-n representation of n+p. The relation a(n)=d(1) holds, if n is a prime index. For this reason there are infinitely many terms which are equal to 1.`
	FORMULA	`a(n)=binomial(n+p,p) mod n.` `a(n)=1 if n is a prime > p, since binomial(n+p,n)==(1+floor(p/n))(mod n), provided n is a prime.`
	CROSSREFS	`Cf. A000040, A133621-A133625, A133630, A133633-A133636.` `Cf. A133880, A133890, A133900, A133910.` `Sequence in context: A138609 A056699 A127296 this_sequence A145961 A082928 A139524` `Adjacent sequences: A133617 A133618 A133619 this_sequence A133621 A133622 A133623`
	KEYWORD	`nonn`
	AUTHOR	`Hieronymus Fischer (Hieronymus.Fischer(AT)gmx.de), Sep 30 2007`

page 1

Search completed in 0.003 seconds

Last modified December 4 20:00 EST 2008. Contains 151309 sequences.

AT&T Labs Research