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.

A122902 First occurrence of exponent n in A080121 corresponding to the minimum prime of the form (k^(2^n) + (k+1)^(2^n)) = A122900(k).

This page as a plain text file.
%I A122902 #19 Feb 16 2025 08:33:02
%S A122902 1,3,23,21,10,95,255,86,59
%N A122902 First occurrence of exponent n in A080121 corresponding to the minimum prime of the form (k^(2^n) + (k+1)^(2^n)) = A122900(k).
%C A122902 Minimum primes of the form n^(2^m) + (n+1)^(2^m) are listed in A122900. The exponents m are listed in A080121.
%C A122902 a(10)-a(13)>1000, a(14)-a(16)>100.
%H A122902 T. D. Noe, <a href="http://www.sspectra.com/math/GenFermatPrimes.txt">Table of generalized Fermat primes of the form (k+1)^2^m + k^2^m</a>
%H A122902 Eric Weisstein's World of Mathematics, <a href="https://mathworld.wolfram.com/GeneralizedFermatNumber.html">Generalized Fermat Number</a>
%e A122902 A080121 begins with 1,1,2,1,1,2,1,2,1,5,?,1,2,1,?,2,1,?,1,?,4,1,3,1,..., where the unknown terms (denoted with ?) are at least 10. So a(1) = 1, a(2) = 3, a(3) = 23, a(4) = 21, a(5) = 10.
%Y A122902 Cf. A077659, A080121, A122900, A080208, A078902, A080134, A019434, A153504, A152913, A194185.
%K A122902 hard,more,nonn
%O A122902 1,2
%A A122902 _Alexander Adamchuk_, Sep 18 2006, Oct 01 2006
%E A122902 Edited by _Max Alekseyev_, Sep 09 2020