The OEIS mourns the passing of Jim Simons and is grateful to the Simons Foundation for its support of research in many branches of science, including the OEIS.
login
The OEIS is supported by the many generous donors to the OEIS Foundation.

 

Logo
Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
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 (list; graph; refs; listen; history; text; internal format)
OFFSET
1,1
COMMENTS
The n = 2 case is mentioned in Eric Weisstein's website.
LINKS
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

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Style Sheet | Transforms | Superseeker | Recents
The OEIS Community | Maintained by The OEIS Foundation Inc.

License Agreements, Terms of Use, Privacy Policy. .

Last modified May 16 17:27 EDT 2024. Contains 372554 sequences. (Running on oeis4.)