A367228 Products of two consecutive Fermat numbers: a(n) = A000215(n) * A000215(n+1).

15, 85, 4369, 16843009, 281479271743489, 79228162532711081671548469249, 6277101735386680764176071790128604879584176795969512275969

Offset

0,1

Comments

a(7) has 116 digits and is too large to include in the data section.

Szymiczek (1966) proved that a(n) is a super-Poulet number (A050217) for all n >= 2. All the composite Fermat numbers (A281576) are also super-Poulet numbers.

References

Michal Krížek, Florian Luca and Lawrence Somer, 17 Lectures on Fermat Numbers, Springer-Verlag, N.Y., 2001, p. 142.

Links

Amiram Eldar, Table of n, a(n) for n = 0..10

Andrzej Rotkiewicz, On pseudoprimes having special forms and a solution of K. Szymiczek's problem, Acta Mathematica Universitatis Ostraviensis, Vol. 13, No. 1 (2005), pp. 57-71.

Kazimierz Szymiczek, Note on Fermat numbers, Elemente der Mathematik, Vol. 21, No. 3 (1966), p. 59.

Formula

a(n) = (2^(2^n) + 1) * (2^(2^(n+1)) + 1).

Mathematica

f[n_] := 2^(2^n) + 1; a[n_] := f[n] * f[n + 1]; Array[a, 7, 0]

Prog

(PARI) f(n) = 2^(2^n) + 1;
a(n) = f(n) * f(n+1);

Crossrefs

Cf. A000215, A050217, A281576.

Sequence in context: A206170 A177882 A199897 * A309922 A302948 A230676

Adjacent sequences: A367225 A367226 A367227 * A367229 A367230 A367231

Keyword

nonn,easy

Author

Amiram Eldar, Nov 11 2023

Status

approved