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 A253655 #11 Sep 08 2022 08:46:10
%S A253655 9,116,2580,19544,295020,804076,4022064,7839780,24670536,99133020,
%T A253655 147912160,427612404,791672280,1053546956,1796518224,3694034916,
%U A253655 7030054140,8586690620,15076346164,21349986840,25222305336,40514492720,54489965796,82830096360,138828513824,176919851700
%N A253655 Number of monic irreducible polynomials of degree 6 over GF(prime(n)).
%H A253655 Robert Israel, <a href="/A253655/b253655.txt">Table of n, a(n) for n = 1..10000</a>
%F A253655 a(n) = (p^6 - p^3 - p^2 + p)/6, where p = prime(n).
%e A253655 For n=1 the a(1) = 9 irreducible monic polynomials of degree 6 over GF(2) are
%e A253655 x^6+x^5+1, x^6+x^3+1, x^6+x^5+x^4+x^2+1, x^6+x^5+x^3+x^2+1, x^6+x+1, x^6+x^5+x^4+x+1, x^6+x^4+x^3+x+1, x^6+x^5+x^2+x+1, x^6+x^4+x^2+x+1.
%p A253655 f:= p-> (p^6 - p^3 - p^2 + p)/6:
%p A253655 seq(f(ithprime(i)), i=1..100); # _Robert Israel_, Jan 07 2015
%t A253655 Table[(Prime[n]^6 - Prime[n]^3 - Prime[n]^2 + Prime[n]) / 6, {n, 1, 30}] (* _Vincenzo Librandi_, Jan 08 2015 *)
%o A253655 (Magma) [(p^6 - p^3 - p^2 + p) div 6: p in PrimesUpTo(110)]; // _Vincenzo Librandi_, Jan 08 2015
%Y A253655 Cf. A008837, A127919, A138420, A138426.
%K A253655 nonn
%O A253655 1,1
%A A253655 _Robert Israel_, Jan 07 2015