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.

A228845 Least m such that (2k+1)*2^m + 1 is a prime factor of the Fermat number 2^(2^n) + 1.

Original entry on oeis.org

1, 2, 4, 8, 16, 7, 8, 9, 11, 11, 12, 13, 14
Offset: 0

Views

Author

Arkadiusz Wesolowski, Sep 05 2013

Keywords

Comments

a(n) >= n + 2 for n >= 2.
a(n) = A228846(n) if 2^(2^n) + 1 is prime or semiprime.

Crossrefs