login

Year-end appeal: Please make a donation to the OEIS Foundation to support ongoing development and maintenance of the OEIS. We are now in our 61st year, we have over 378,000 sequences, and we’ve reached 11,000 citations (which often say “discovered thanks to the OEIS”).

A222760
Conjectured least prime p for which binomial(n*q,q) (mod q^3) = n for all primes q >= p.
1
2, 5, 3, 2, 5, 3, 3, 5, 3, 3, 5, 3, 3, 5, 3, 3, 5, 3, 3, 5, 3, 3, 5, 3, 3, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5
OFFSET
1,1
COMMENTS
The n = 2 case is mentioned in Eric Weisstein's website.
MATHEMATICA
lim = 100; Table[r = Table[Mod[Binomial[n*p, p], p^3] == n, {p, Prime[Range[lim]]}]; i = lim; While[i > 0 && r[[i]], i--]; Prime[i + 1], {n, 87}]
CROSSREFS
Cf. A096328 (prime(prime(n)^3)), A222759.
Sequence in context: A362090 A065261 A130848 * A302130 A156637 A195784
KEYWORD
nonn
AUTHOR
T. D. Noe, Mar 13 2013
STATUS
approved