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

A046809 a(n) is the least integer greater than a(n-1) such that a(n-1)*2^a(n) - 1 is prime, a(1) = 1.

Original entry on oeis.org

1, 2, 4, 5, 8, 10, 11, 26, 286, 365, 602, 630, 713, 808, 1327, 3561, 3566, 5286, 5477, 10600, 13485, 15441, 17339, 76856, 277718, 279098, 977278, 3437687, 3564664, 3883403, 4254462, 4972164
Offset: 1

Views

Author

Chad Davis (cad16(AT)po.cwru.edu)

Keywords

Comments

Previous name was: Recursive sequence of indices of Proth primes a*2^b - 1.

Crossrefs

Cf. A046808.

Programs

  • PARI
    a=1;until(,print1(a,", ");for(b=a+1,+oo,if(ispseudoprime(a*2^b-1),a=b;break()))) \\ Jeppe Stig Nielsen, Apr 29 2022

Extensions

a(25)-a(27) from Kellen Shenton Apr 29 2022
a(28)-a(32) from Kellen Shenton, Jun 15 2025
Showing 1-1 of 1 results.