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 A089485 #19 Feb 13 2023 14:18:33 %S A089485 3,5,15,35,55 %N A089485 Numbers k such that k^4 + 4^k = A001589(k) is a semiprime. %C A089485 For n = 2*k + 1, n^4 + 4^n = (n^2 + n*2^(k + 1) + 2^n) * (n^2 - n*2^(k + 1) + 2^n) The sequence gives those values of n for which both parentheses are primes. No further terms were found for k<=5000. %C A089485 a(6) > 120000, if it exists. - _Tyler Busby_, Feb 13 2023 %H A089485 Ignacio Larrosa Cañestro et al., <a href="https://groups.google.com/d/msg/sci.math/ukqOhcTAoyU/rmeXZwI6oXAJ">Find all primes of the form 4^n + n^4.</a> Discussion in newsgroup sci.math (2003). %e A089485 a(1)=3 because 3^4+4^3=145=5*29, a(2)=5 because 5^4+4^5=1649=17*97. %t A089485 Select[Range[60],PrimeOmega[#^4+4^#]==2&] (* _Harvey P. Dale_, Jul 31 2020 *) %o A089485 (PARI) for(k=0,5000,my(n=2*k+1,p1=n^2+n*2^(k+1)+2^n,p2=n^2-n*2^(k+1)+2^n);if(ispseudoprime(p1)&&ispseudoprime(p2),print1(n,", "))) \\ _Hugo Pfoertner_, Jul 24 2019 %Y A089485 Cf. A001589. %K A089485 nonn,more %O A089485 1,1 %A A089485 _Hugo Pfoertner_, Nov 11 2003