|
| |
|
|
A133908
|
|
Least odd prime number m such that binomial(n+m,m) mod m = 1.
|
|
0
| |
|
|
3, 3, 5, 5, 7, 7, 11, 11, 3, 3, 3, 13, 17, 17, 17, 17, 19, 3, 3, 3, 23, 23, 29, 29, 5, 5, 3, 3, 3, 31, 37, 37, 37, 37, 37, 3, 3, 3, 41, 41, 43, 43, 47, 47, 3, 3, 3, 53, 7, 5, 5, 5, 5, 3, 3, 3, 59, 59, 61, 61, 67, 67, 3, 3, 3, 67, 71, 71, 71, 71, 73, 3, 3, 3, 5, 5, 5, 5, 5, 83, 3, 3, 3, 89, 89
(list; graph; refs; listen; history; internal format)
|
|
|
|
OFFSET
| 1,1
|
|
|
COMMENTS
| Also the least odd prime number m such that m divides floor(n/m) or m>n.
|
|
|
EXAMPLE
| a(3)=5, since binomial(3+5,5) mod 5 = 56 mod 5 = 1 and 5 is the minimal odd prime number with this property.
a(8)=11 because of binomial(8+11,11)=75582=6871*11+1, but binomial(8+k,k) mod k<>1 for all odd primes <11.
|
|
|
CROSSREFS
| Cf. A000040, A133620, A133621, A133623, A133630, A133635.
Cf. A133872, A133880, A133890, A133900, A133910.
Sequence in context: A175298 A073737 A187072 * A111213 A095878 A077381
Adjacent sequences: A133905 A133906 A133907 * A133909 A133910 A133911
|
|
|
KEYWORD
| nonn
|
|
|
AUTHOR
| Hieronymus Fischer (Hieronymus.Fischer(AT)gmx.de), Oct 20 2007
|
| |
|
|
