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.

A263875 a(n) = least positive k such that A263874(n) + 2^k is prime.

Original entry on oeis.org

1, 2, 3, 4, 5, 8, 10, 20, 29, 955, 4583176, 9092392
Offset: 1

Views

Author

Arkadiusz Wesolowski, Oct 28 2015

Keywords

Comments

A263874 gives where the records occur.

Crossrefs

Programs

  • PARI
    a=1; forstep(n=1, 773, 2, k=1; while(!ispseudoprime(n+2^k), k++); if(k+1>a, print1(k, ", "); a=k+1));