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 A301524 #19 Sep 03 2024 17:19:36 %S A301524 3,5,15,27 %N A301524 Numbers k such that 16*k^k - 1 is prime. %C A301524 All terms are odd since 16*(2*m)^(2*m) - 1 = (2^(m+2)*m^m - 1)*(2^(m+2)*m^m + 1). - _Altug Alkan_, Mar 23 2018 %C A301524 a(5), if it exists, is greater than 5000. - _Vaclav Kotesovec_, Mar 25 2018 %C A301524 a(5), if it exists, is greater than 20000. - _Michael S. Branicky_, Sep 03 2024 %t A301524 Select[Range[1000], PrimeQ[16*#^# - 1] &] (* _Vaclav Kotesovec_, Mar 25 2018 *) %o A301524 (PARI) for(n=0, 1000, if(isprime(16*n^n-1), print1(n", "))) %Y A301524 Cf. A110931, A301522. %K A301524 nonn,more %O A301524 1,1 %A A301524 _Seiichi Manyama_, Mar 23 2018