id:A133623 - OEIS Search Results

Search: id:A133623

Displaying 1-1 of 1 results found.

page 1

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

+0
19

0, 0, 2, 3, 1, 0, 1, 5, 4, 6, 1, 11, 1, 8, 6, 9, 1, 16, 1, 11, 8, 12, 1, 21, 1, 14, 10, 15, 1, 26, 1, 17, 12, 18, 1, 31, 1, 20, 14, 21, 1, 36, 1, 23, 16, 24, 1, 41, 1, 26, 18, 27, 1, 46, 1, 29, 20, 30, 1, 51, 1, 32, 22, 33, 1, 56, 1, 35, 24, 36, 1, 61, 1, 38, 26, 39, 1, 66, 1, 41, 28, 42, 1 (list; graph; listen)

	OFFSET	`1,3`
	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+3,3) mod n.` `a(n)=1 if n is a prime > 3, since binomial(n+3,n)==(1+floor(3/n))(mod n), provided n is a prime.`
	CROSSREFS	`Cf. A000040, A133620-A133625, A133630, A133633-A133636.` `Cf. A133873, A133883, A133880, A133890, A133900, A133910.` `Sequence in context: A006705 A031269 A006703 this_sequence A065862 A020921 A154720` `Adjacent sequences: A133620 A133621 A133622 this_sequence A133624 A133625 A133626`
	KEYWORD	`nonn`
	AUTHOR	`Hieronymus Fischer (Hieronymus.Fischer(AT)gmx.de), Sep 30 2007`

page 1

Search completed in 0.002 seconds

Last modified December 9 18:50 EST 2009. Contains 170568 sequences.

AT&T Labs Research