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 A264900 #10 Nov 28 2015 19:17:27
%S A264900 1,13,43,71,101,149,163,191,233,257,259,277,307,311,373,389,421,439,
%T A264900 463,563,571,617,647,743,751,763,871,899,907,971,1099,1171,1223,1429,
%U A264900 1517,1577,1621,1631,1687,1691,1709,1741,1757,1759,1777,1841,1871,1963
%N A264900 Integers k such that A122102(k) + 1 is prime.
%C A264900 Only a(11) = 259 is a composite number for n <= 25.
%C A264900 Initial corresponding primes are 17, 6870733, 9723349723 and 190977764951.
%e A264900 a(1) = 1 because 2^4 + 1 = 17 is prime.
%t A264900 Select[Range@ 2000, PrimeQ[Sum[Prime[k]^4, {k, #}] + 1] &] (* _Michael De Vlieger_, Nov 28 2015 *)
%o A264900 (PARI) a(n) = sum(k=1, n, prime(k)^4)+1;
%o A264900 for(n=0, 3000, if(ispseudoprime(a(n)) , print1(n, ", ")))
%Y A264900 Cf. A122102.
%K A264900 nonn
%O A264900 1,2
%A A264900 _Altug Alkan_, Nov 27 2015