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 A163268 #21 Jul 13 2022 14:08:00
%S A163268 2,3,5,13,17,31,61,73,89,149,163,251,349,353,461,523,599,647,863,941,
%T A163268 947,1087,1117,1229,1277,1291,1297,1409,1439,1489,1567,1579,1609,1627,
%U A163268 1753,1783,1831,2039,2131,2293,2531,2609,2753,2861,3037,3163,3167,3299
%N A163268 Primes p such that 1 + p + p^2 + p^3 + p^4 + p^5 + p^6 is prime.
%C A163268 Primes in A100330. The generated prime numbers are exactly A194257. [_Bernard Schott_, Dec 21 2012]
%H A163268 Robert Israel, <a href="/A163268/b163268.txt">Table of n, a(n) for n = 1..10000</a> (first 102 terms from Zak Seidov)
%p A163268 select(p -> isprime(p) and isprime(1+p+p^2+p^3+p^4+p^5+p^6), [2,seq(i,i=3..10000,2)]); # _Robert Israel_, May 05 2017
%t A163268 f[n_]:=1+n+n^2+n^3+n^4+n^5+n^6; lst={}; Do[p=Prime[n]; If[PrimeQ[f[p]], AppendTo[lst,p]], {n,7!}]; lst
%t A163268 Select[Prime[Range[500]],PrimeQ[Total[#^Range[0,6]]]&] (* _Harvey P. Dale_, Jul 13 2022 *)
%o A163268 (PARI) n=0;forprime(p=2,10000,isprime((p^7-1)/(p-1))&&print(n++" "p))\\ _Zak Seidov_, Mar 09 2013
%Y A163268 Cf. A053182, A065509, A088550, A100330, A163268, A194257.
%K A163268 nonn
%O A163268 1,1
%A A163268 _Vladimir Joseph Stephan Orlovsky_, Jul 24 2009
%E A163268 Edited (but not checked) by _N. J. A. Sloane_, Jul 25 2009