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.

A263539 Smallest odd prime of the form k*a(n-1)*a(n-2)*...*a(1) + 2.

Original entry on oeis.org

3, 5, 17, 257, 65537, 73014444017, 7839866227890585600377, 90965983657404652017189201081165598949585237, 59265532390032181385721703100931439246761487956490653915298719426194939212611074425177277
Offset: 1

Views

Author

Jeppe Stig Nielsen, Oct 20 2015

Keywords

Comments

Infinite sequence of primes which coincides with Fermat primes, a(n) = A019434(n-1), only for n <= 5.
For the k values, see A263540.

Crossrefs

Cf. A071580, A090475, A263540, A019434.

Programs

  • PARI
    terms=12; p=1; for(n=1, terms, q=p+2; while(!ispseudoprime(q), q+=2*p); print1(q, ", "); p*=q)
Showing 1-1 of 1 results.

Started in 1964 by Neil J. A. Sloane | Maintained by The OEIS Foundation Inc.

Content is available under The OEIS End-User License Agreement.