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.

A371757 Numbers of the form (4^(p^(k+1)) + 1)/(4^(p^k) + 1), where k >= 1 and p is an odd prime other than 5.

Original entry on oeis.org

4033, 68719214593, 19341632594266545643831297, 324518553658426708768757511094273, 1684996264962499703367587717863072443065045481313942556034056847361
Offset: 1

Views

Author

Amiram Eldar, Apr 05 2024

Keywords

Comments

MÄ…kowski and Rotkiewicz (1969) proved that all the terms are Fermat pseudoprimes to base 2 (A001567).
The next term has 94 digits and is too large to include in the data section.

Crossrefs

Subsequence of A001567.

Programs

  • Mathematica
    f[p_, k_] := (4^(p^(k + 1)) + 1)/(4^(p^k) + 1);
    seq[max_] := Module[{s = {}, p = 3, f1, k, addFlag = True}, While[addFlag, If[p == 5, Continue[]]; k = 1; addFlag = False; While[(f1 = f[p, k]) < max, AppendTo[s, f1]; addFlag = True; k++]; p = NextPrime[p, If[p == 3, 2, 1]]]; Sort[s]]; seq[10^80]