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.

A343120 a(n) is the smallest number b such that (b^(2^k) + 1)/2 is prime for k = 0, 1, ..., n.

Original entry on oeis.org

3, 3, 3, 205, 2326161, 20589460461, 3847314721101
Offset: 0

Views

Author

Jeppe Stig Nielsen, Apr 05 2021

Keywords

Examples

			For n=3, the four numbers (205+1)/2, (205^2+1)/2, (205^4+1)/2, and (205^8+1)/2 are prime, and 205 is smallest with this property, so a(3)=205.
		

Crossrefs

Programs

  • PARI
    a(n)=forstep(b=3,+oo,2,for(k=0,n,!ispseudoprime((b^(2^k)+1)/2)&&next(2));return(b)) \\ if a(n-1) is known, b loop can start from there instead

Extensions

a(6) found by Kellen Shenton added by Jeppe Stig Nielsen, Apr 09 2021