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.

A132198 a(n) is the least prime >= 2^(2^n).

Original entry on oeis.org

2, 5, 17, 257, 65537, 4294967311, 18446744073709551629, 340282366920938463463374607431768211507, 115792089237316195423570985008687907853269984665640564039457584007913129640233
Offset: 0

Views

Author

Leroy Quet, Nov 05 2007

Keywords

Comments

The next term has 155 digits. - Harvey P. Dale, Aug 31 2016
For further terms, consult A097521 or A129786. - Jeppe Stig Nielsen, Nov 18 2019

Crossrefs

Programs

  • Maple
    2,seq(nextprime(2^(2^n)),n=1..8); # Emeric Deutsch, Nov 26 2007
  • Mathematica
    Join[{2},NextPrime/@(2^(2^Range[8]))] (* Harvey P. Dale, Aug 31 2016 *)

Extensions

More terms from Emeric Deutsch, Nov 26 2007

A097521 Difference between F(n) = 2^(2^n)+1 and nextprime(F(n)) where F(n) is the n-th Fermat Number.

Original entry on oeis.org

2, 2, 2, 6, 2, 14, 12, 50, 296, 74, 642, 980, 1760, 896, 2774, 118112, 44060, 5850
Offset: 0

Views

Author

Cino Hilliard, Aug 27 2004

Keywords

Comments

In the Name, nextprime means A151800, not A007918. - Jeppe Stig Nielsen, Nov 18 2019
a(n) = A129786(n)-1 except in the rare case that F(n) is a prime. - Jeppe Stig Nielsen, Nov 18 2019

Examples

			F(5) = 4294967297. Nextprime(F(5)) = 4294967311.
4294967311 - 4294967297 = 14 the 6th entry in the table.
		

Crossrefs

Programs

  • PARI
    for(n=0,+oo,print1(nextprime(2^(2^n)+2)-(2^(2^n)+1),", ")) \\ Jeppe Stig Nielsen, Nov 18 2019

Formula

a(n) = A013632(A000215(n)). - Michel Marcus, Nov 18 2019

Extensions

More terms with the help of A129786 from Jeppe Stig Nielsen, Nov 18 2019
Showing 1-2 of 2 results.