|
| |
|
|
A133625
|
|
Binomial(n+p, n) mod n where p=5.
|
|
32
| |
|
|
0, 1, 2, 2, 2, 0, 1, 7, 4, 3, 1, 8, 1, 8, 9, 13, 1, 7, 1, 10, 8, 12, 1, 3, 6, 1, 10, 8, 1, 2, 1, 25, 12, 1, 8, 22, 1, 20, 14, 39, 1, 15, 1, 12, 25, 24, 1, 5, 1, 11, 18, 14, 1, 46, 12, 43, 20, 1, 1, 48, 1, 32, 22, 49, 14, 23, 1, 18, 24, 50, 1, 7, 1, 1, 41, 20, 1, 66, 1, 77, 28, 1, 1, 50, 18, 44
(list; graph; refs; listen; history; internal format)
|
|
|
|
OFFSET
| 1,3
|
|
|
COMMENTS
| 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+5,5) mod n.
a(n)=1 if n is a prime > 5, since binomial(n+5,n)==(1+floor(5/n))(mod n), provided n is a prime.
|
|
|
CROSSREFS
| Cf. A000040, A133620-A133625, A133630, A038509, A133634-A133636.
Cf. A133875, A133885, A133880, A133890, A133900, A133910.
Sequence in context: A056557 A082900 A171958 * A176154 A028930 A112792
Adjacent sequences: A133622 A133623 A133624 * A133626 A133627 A133628
|
|
|
KEYWORD
| nonn
|
|
|
AUTHOR
| Hieronymus Fischer (Hieronymus.Fischer(AT)gmx.de), Sep 30 2007
|
| |
|
|
