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.

A098463 Numbers k such that A055869(k) = (k+1)^k - k^k is prime.

Original entry on oeis.org

2, 3, 5, 7, 167
Offset: 1

Views

Author

Hugo Pfoertner, Sep 14 2004

Keywords

Comments

The next term is > 5000.

Examples

			a(2) = 3 because (3+1)^3 - 3^3 = 4^3 - 3^3 = 64 - 27 = 37 is prime.
		

Crossrefs

Cf. A055869 ((n+1)^n-n^n), A085682 (k^k-(k-1)^k is prime).

Programs

A086877 Primes of the form (k+1)^k - k^k.

Original entry on oeis.org

5, 37, 4651, 1273609
Offset: 1

Views

Author

Cino Hilliard, Aug 21 2003

Keywords

Crossrefs

The values of k are in A098463.
Primes in A055869.
Cf. A085682.

Programs

  • PARI
    f(n) = for(x=1,n,y=(x+1)^x-x^x; if(isprime(y),print1(y, ", ")))

Formula

a(n) = A055869(A098463(n)). - Elmo R. Oliveira, Feb 19 2025

A255730 Numbers k such that k^k - (k-1)^k + k is prime.

Original entry on oeis.org

1, 2, 4, 16, 52, 80
Offset: 1

Views

Author

Vincenzo Librandi, Mar 13 2015

Keywords

Comments

a(6) corresponds to a prime having 153 digits.
If it exists, a(7) > 5000.
k does not have the form 20m+2 (which leads to a multiple of 5) or 42m+26 (which leads to a multiple of 7).
If it exists, a(7) > 20000. - Michael S. Branicky, Oct 09 2024

Examples

			4 is in the sequence because 4^4 - 3^4 + 4 = 179 is prime.
		

Crossrefs

Cf. A085682.

Programs

  • Magma
    [n: n in [0..500] |IsPrime(n^n - (n-1)^n + n)];
    
  • Mathematica
    Select[Range[1000], PrimeQ[#^# - (# - 1)^# + #] &]
  • PARI
    is(n)=ispseudoprime(n^n-(n-1)^n+n) \\ Charles R Greathouse IV, Jun 13 2017
Showing 1-3 of 3 results.