cp's OEIS Frontend

This is a front-end for the Online Encyclopedia of Integer Sequences, made by Christian Perfect. The idea is to provide OEIS entries in non-ancient HTML, and then to think about how they're presented visually. The source code is on GitHub.

Showing 1-3 of 3 results.

A058013 Smallest prime p such that (n+1)^p - n^p is prime.

Original entry on oeis.org

2, 2, 2, 3, 2, 2, 7, 2, 2, 3, 2, 17, 3, 2, 2, 5, 3, 2, 5, 2, 2, 229, 2, 3, 3, 2, 3, 3, 2, 2, 5, 3, 2, 3, 2, 2, 3, 3, 2, 7, 2, 3, 37, 2, 3, 5, 58543, 2, 3, 2, 2, 3, 2, 2, 3, 2, 5, 3, 4663, 54517, 17, 3, 2, 5, 2, 3, 3, 2, 2, 47, 61, 19, 23, 2, 2, 19, 7, 2, 7, 3, 2, 331, 2, 179, 5, 2, 5, 3, 2, 2
Offset: 1

Views

Author

Robert G. Wilson v, Nov 13 2000

Keywords

Comments

The terms a(47) and a(60) [were] unknown. The sequence continues at a(48): 2, 3, 2, 2, 3, 2, 2, 3, 2, 5, 3, 4663, a(60)=?, continued at a(61): 17, 3, 2, 5, 2, 3, 3, 2, 2, 47, 61, 19, 23, 2, 2, 19, 7, 2, 7, 3, 2, 331, 2, 179, 5, 2, 5, 3, 2, 2. - Hugo Pfoertner, Aug 27 2004
In September and November 2005, Jean-Louis Charton found a(60)=54517 and a(47)=58543, respectively. Earlier, Mike Oakes found a(106)=7639 and a(124)=5839. All these large values of a(n) yield probable primes. - T. D. Noe, Dec 05 2005, Sep 18 2008
a(106) = 6529 and a(124) = 5167 are true.
a(137) is probably 196873 from prime of this form discovered by Jean-Louis Charton in December 2009 and reported to Henri Lifchitz's PRP Top. - Robert Price, Feb 17 2012
a(138) through a(150) is 2,>32401,2,2,3,8839,5,7,2,3,5,271,13. - Robert Price, Feb 17 2012
a(276)=88301, a(139)>240000 and a(256)>100000. - Jean-Louis Charton, Jun 27 2012
Three more terms found, a(325)=81943, a(392)=64747, a(412)=56963 and also a(139)>260000, a(295)>100000, a(370)>100000, a(373)>100000. 29 unknown terms < 1000 remain. - Jean-Louis Charton, Aug 15 2012
Three more terms a(577)=55117, a(588)=60089 and a(756)=96487. - Jean-Louis Charton, Dec 13 2012
Three more (PRP) terms a(845)=83761, a(897)=48311, a(918)=54919. - Jean-Louis Charton, Dec 31 2013.
Some of the results were computed using the PrimeFormGW (PFGW) primality-testing program. - Hugo Pfoertner, Nov 14 2019

Links

Crossrefs

Cf. A065913, A103794, A115596, A247244.
Cf. A000043, A057468, A059801, A059802, A062572-A062666, A215538.

Programs

  • Mathematica
    lmt = 10000; f[n_] := Block[{p = 2}, While[p < lmt && !PrimeQ[(n+1)^p - n^p], p = NextPrime@ p]; If[p > lmt, 0, p]]; Do[ Print[{n, f[n] // Timing}], {n, 1000}] (* Robert G. Wilson v, Dec 01 2014 *)
spp[n_]:=Module[{p=2},While[!PrimeQ[(n+1)^p-n^p],p=NextPrime[p]];p]; Array[spp,90] (* Harvey P. Dale, Jul 01 2025 *)
  • PARI
    a(n)=forprime(p=2,default(primelimit),if(ispseudoprime((n+1)^p-n^p),return(p))) \\ Charles R Greathouse IV, Feb 20 2012

Formula

a((p-1)/2) = 2 for odd primes p. - Alexander Adamchuk, Dec 01 2006

Extensions

More terms from T. D. Noe, Dec 05 2005
Typo in first Mathematica program corrected by Ray Chandler, Feb 22 2017

A125713 Smallest odd prime p such that (n+1)^p - n^p is prime.

Original entry on oeis.org

3, 3, 3, 3, 5, 3, 7, 7, 3, 3, 3, 17, 3, 3, 43, 5, 3, 1607, 5, 19, 127, 229, 3, 3, 3, 13, 3, 3, 149, 3, 5, 3, 23, 3, 5, 83, 3, 3, 37, 7, 3, 3, 37, 5, 3, 5, 58543, 3, 3, 7, 29, 3, 479, 5, 3, 19, 5, 3, 4663, 54517, 17, 3, 3, 5, 7, 3, 3, 17, 11, 47, 61, 19, 23, 3, 5, 19, 7, 5, 7, 3, 3
Offset: 1

Views

Author

Alexander Adamchuk, Dec 01 2006, Feb 15 2007

Keywords

Comments

Corresponding smallest primes of the form (n+1)^p - n^p, where p = a(n) is an odd prime, are listed in A121091(n+1) = {7, 19, 37, 61, 4651, 127, 1273609, 2685817, 271, 331, 397, 6431804812640900941, 547, 631, ...}. a(n) = A058013(n) for n = {4, 7, 10, 12, 13, 16, 17, 19, 22, 24, 25, 27, 28, 31, ...} = A047845(n) = (n-1)/2, where n runs through odd nonprimes (A014076), for n>1. a(97) = 7. a(99)..a(112) = {5, 43, 5, 13, 7, 5, 3, 6529, 59, 3, 5, 5, 113, 5}. a(114) = 139. a(117)..a(129) = {7, 13, 3, 5, 5, 7, 3, 5167, 3, 41, 59, 3, 3}. a(131) = 101. a(n) is currently unknown for n = {113, 115, 116, 130, 132, ...}.
a(96) = 1307, a(98) = 709.
a(137) is probably 196873 from a prime of this form discovered by Jean-Louis Charton in December 2009 and reported to Henri Lifchitz's PRP Top. - Robert Price, Feb 17 2012
a(138) through a(150) are 113, >32401, 3, 7, 3, 8839, 5, 7, 13, 3, 5, 271, 13. - Robert Price, Feb 17 2012
a(137) = 196873 confirmed by Fischer link; a(139) > 260000. - Ray Chandler, Feb 26 2017

Links

Crossrefs

Cf. A058013 (smallest prime p such that (n+1)^p - n^p is prime).
Cf. A065913 (smallest prime of form (n+1)^k - n^k).
Cf. A121091 (smallest nexus prime of the form n^p - (n-1)^p, where p is odd prime).
Cf. A047845, A014076.
Cf. A062585 (numbers n such that k^n - (k-1)^n is prime, where k is 19).
Cf. A000043, A057468, A059801, A059802, A062572-A062666.

A121091 Smallest nexus prime of the form n^p - (n-1)^p, where p is an odd prime.

Original entry on oeis.org

7, 19, 37, 61, 4651, 127, 1273609, 2685817, 271, 331, 397, 6431804812640900941, 547, 631, 5613125740675652943160572913465695837595324940170321, 371281, 919
Offset: 2

Views

Author

Alexander Adamchuk, Aug 11 2006, revised Dec 01 2006, Feb 15 2007

Keywords

Comments

a(19) = 19^1607 - 18^1607, which is too large to include. It has 2055 decimal digits. See A062585(1) = 1607.
a(20)-a(21) = {723901, 8005616640331026125580781}. a(n) is currently known for all n up to n = 96. Corresponding smallest odd primes p such that (n+1)^p - n^p is prime are listed in A125713(n) = {3,3,3,3,5,3,7,7,3,3,3,17,3,3,43,5,3,10957,5,19,127,229,3,3,3,13,3,3,149,3,5,3,23,3,5,83,3,3,37,7,3,3,37,5,3,5,58543,...}. a(n+1) = A065013(n) for n = {4, 7, 10, 12, 13, 16, 17, 19, 22, 24, 25, 27, 28, 31, ...} = A047845(n) = (n-1)/2, where n runs through odd nonprimes (A014076), for n>1.

Crossrefs

Cf. A121620, A000043, A058765, A121616, A121618.
Cf. A125713 = Smallest odd prime p such that (n+1)^p - n^p is prime. Cf. A065913 = Smallest prime of form (n+1)^k - n^k. Cf. A058013 = Smallest prime p such that (n+1)^p - n^p is prime. Cf. A047845, A014076.
Cf. A062585 = numbers n such that k^n - (k-1)^n is prime, where k is 19. Cf. A000043, A057468, A059801, A059802, A062572-A062666.

Formula

a(n) = n^A125713(n) - (n-1)^A125713(n).
Showing 1-3 of 3 results.

Started in 1964 by Neil J. A. Sloane | Maintained by The OEIS Foundation Inc.

Content is available under The OEIS End-User License Agreement.