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!)
A229073 Least m >= 2 such that m^p - (m - 1)^p is composite for p = prime(n) but no smaller prime p. 1
5, 6, 4, 3, 2, 6525, 809652229 (list; graph; refs; listen; history; text; internal format)
OFFSET
1,1
COMMENTS
Equivalently, least m such that A087896(m) = prime(n).
There are no other terms <= 10^9.
LINKS
MATHEMATICA
Table[m = 2; While[! And @@ Table[PrimeQ[m^Prime[i] - (m-1)^Prime[i]], {i, n-1}] || PrimeQ[m^Prime[n] - (m-1)^Prime[n]], m++]; m, {n, 6}] (* T. D. Noe, Sep 12 2013 *)
CROSSREFS
Cf. A087896.
Sequence in context: A064206 A087197 A221216 * A019818 A187146 A128632
KEYWORD
nonn,hard
AUTHOR
Eric M. Schmidt, Sep 12 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 15 14:34 EDT 2024. Contains 372540 sequences. (Running on oeis4.)