id:A133624 - OEIS Search Results

Search: id:A133624

Displaying 1-1 of 1 results found.

page 1

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

+0
2

0, 1, 2, 2, 1, 0, 1, 7, 4, 1, 1, 8, 1, 8, 6, 13, 1, 7, 1, 6, 8, 12, 1, 3, 1, 1, 10, 8, 1, 26, 1, 25, 12, 1, 1, 22, 1, 20, 14, 31, 1, 15, 1, 12, 16, 24, 1, 5, 1, 1, 18, 14, 1, 46, 1, 43, 20, 1, 1, 36, 1, 32, 22, 49, 1, 23, 1, 18, 24, 36, 1, 7, 1, 1, 26, 20, 1, 66, 1, 61, 28, 1, 1, 50, 1, 44, 30 (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+4,4) mod n.` `a(n)=1 if n is a prime > 4, since binomial(n+4,n)==(1+floor(4/n))(mod n), provided n is a prime.`
	CROSSREFS	`Cf. A000040, A133620-A133625, A133630, A133633-A133636.` `Cf. A133874, A133884, A133880, A133890, A133900, A133910.` `Sequence in context: A055290 A125629 A141335 this_sequence A030110 A083570 A096830` `Adjacent sequences: A133621 A133622 A133623 this_sequence A133625 A133626 A133627`
	KEYWORD	`nonn`
	AUTHOR	`Hieronymus Fischer (Hieronymus.Fischer(AT)gmx.de), Sep 30 2007`

page 1

Search completed in 0.002 seconds

Last modified August 19 23:53 EDT 2008. Contains 142930 sequences.

AT&T Labs Research