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.
%I A122900 #9 Jun 13 2021 08:52:34
%S A122900 5,13,337,41,61,3697,113,10657,181,2211377674535255285545615254209921
%N A122900 Minimum prime of the form n^k + (n+1)^k for k>1, or 0 if no such prime exists.
%C A122900 Currently a(n) is unknown for n = {11, 15, 18, 20, 28, 44, 46, 49, 51, 52, 53, 55, 57, 58, 61, 62, 64, 71, 73, 77, 81, 83, 91, 92, 94, ...}. All n < 100 and 1 < k < 2^10 have been checked.
%C A122900 All nonzero a(n) have a form n^(2^m) + (n+1)^(2^m).
%C A122900 The exponents m are listed in A080121. The first occurrence of each exponent m in A080121 is listed in A122902.
%e A122900 a(1) = 5 because 1^2 + 2^2 = 5 is prime.
%e A122900 a(2) = 13 because 2^2 + 3^2 = 13 is prime.
%e A122900 a(3) = 337 because 3^4 + 4^4 = 337 is prime but 3^3 + 4^3 = 91 and 3^2 + 4^2 = 25 are composite.
%Y A122900 Cf. A077659, A080121, A122902, A080208.
%K A122900 hard,nonn
%O A122900 1,1
%A A122900 _Alexander Adamchuk_, Sep 18 2006
%E A122900 Edited by _Max Alekseyev_, Sep 09 2020