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 A378490 #19 Dec 12 2024 23:30:28 %S A378490 3,3,3,13,89,29,37,113,113,13,1151,43,53,5503 %N A378490 Least prime p such that p^(2^n) + 2^(2^n) is prime. %F A378490 a(n) = A132260(n,1) for n>=3. %e A378490 a(1) = 3, because 3^(2^1) + 2^(2^1) = 13 is prime and no smaller prime satisfies the condition. %o A378490 (PARI) a(n) = my(p=2, q=2^n); while (!ispseudoprime(p^q + 2^q), p=nextprime(p+1)); p; \\ _Michel Marcus_, Nov 28 2024 %Y A378490 Cf. A001146, A132260, A157764, A375215. %K A378490 nonn,more %O A378490 0,1 %A A378490 _Jean-Marc Rebert_, Nov 28 2024