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 A259257 #20 Sep 08 2022 08:46:13
%S A259257 11,61,521,9091,13421,19141,61681,152381,185641,224071,1151041,
%T A259257 1824841,2031671,3341101,4778021,5200081,8987221,25058741,31224301,
%U A259257 32928901,40454321,42521761,150451621,212601841,250062751,292268861,310565641,329708341,339604921
%N A259257 Primes of the form n^4 - n^3 + n^2 - n + 1.
%H A259257 Ray Chandler, <a href="/A259257/b259257.txt">Table of n, a(n) for n = 1..10000</a> (first 893 terms from Robert Price)
%H A259257 OEIS Wiki, <a href="https://oeis.org/wiki/Cyclotomic Polynomials at x=sigma(n)">Cyclotomic Polynomials at x=sigma(n)</a>
%F A259257 a(n) = A246392(A060884(n)).
%t A259257 Select[Table[Cyclotomic[10, n], {n, 0, 200}], PrimeQ]
%t A259257 Select[Table[n^4 - n^3 + n^2 - n + 1, {n, 200}], PrimeQ] (* _Vincenzo Librandi_, Jun 23 2015 *)
%o A259257 (Magma) [a: n in [0..200] | IsPrime(a) where a is n^4-n^3+n^2-n+1]; // _Vincenzo Librandi_, Jun 23 2015
%o A259257 (PARI) lista(nn) = for (n=1, nn, if (isprime(p=polcyclo(10, n)), print1(p, ", "))); \\ _Michel Marcus_, Jun 23 2015
%Y A259257 Cf. A060884, A246392.
%K A259257 nonn,easy
%O A259257 1,1
%A A259257 _Robert Price_, Jun 22 2015