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-2 of 2 results.

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

Original entry on oeis.org

1, 2, 3, 5, 7, 8, 158, 536, 4670, 9795
Offset: 1

Views

Author

Matevz Markovic, Feb 25 2014

Keywords

Comments

Next term is >= 30000.

Examples

			3 is in the sequence since (3+1)^(3-1) + 3 = 4^2 + 3 = 19 is prime.
		

Crossrefs

Cf. A187602 (corresponding primes).

Programs

  • Mathematica
    Select[Range[600],PrimeQ[(#+1)^(#-1)+#]&] (* The program generates the first eight terms of the sequence. *) (* Harvey P. Dale, Feb 07 2024 *)
  • PARI
    is(n)=isprime((n+1)^(n-1)+n) \\ Charles R Greathouse IV, Jun 06 2017

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

Original entry on oeis.org

83, 15629, 279941, 3486784409, 6568408355712890639
Offset: 1

Views

Author

Soumadeep Ghosh, Feb 16 2016

Keywords

Comments

The next prime has 171 digits. - Vincenzo Librandi, Feb 17 2016
Subsequence of primes of A155499. - Michel Marcus, Feb 20 2016

Crossrefs

Cf. A309140 (the corresponding values of k).

Programs

  • Magma
    [a: n in [0..100] | IsPrime(a) where a is n^(n+1)+n-1]; // Vincenzo Librandi, Feb 17 2016
    
  • Mathematica
    Select[Table[n^(n + 1) + n - 1, {n, 1, 50}], ProvablePrimeQ[#] &]
  • PARI
    lista(nn) = for(k=1, nn, if(ispseudoprime(q=k^(k+1)+k-1), print1(q, ", "))); \\ Jinyuan Wang, Mar 01 2020
Showing 1-2 of 2 results.