cp's OEIS Frontend

A255500 a(n) = (p^9 + 5*p^8 + 4*p^7 - p^6 - 5*p^5 + 2*p^4)/6 where p is the n-th prime.

%I A255500 #28 May 22 2025 10:21:42
%S A255500 352,9909,698125,12045817,584190541,2487920149,25846158097,
%T A255500 68520305701,367691205289,2846113596901,5135516500321,24650159312557,
%U A255500 61346708983561,93685639700269,206700247118737,602622774810109,1567842813615901,2110866318916741,4876836410298997
%N A255500 a(n) = (p^9 + 5*p^8 + 4*p^7 - p^6 - 5*p^5 + 2*p^4)/6 where p is the n-th prime.
%H A255500 G. C. Greubel, <a href="/A255500/b255500.txt">Table of n, a(n) for n = 1..1000</a>
%H A255500 L. Kaylor and D. Offner, <a href="https://projecteuclid.org/euclid.involve/1513733722">Counting matrices over a finite field with all eigenvalues in the field</a>, Involve, a Journal of Mathematics, Vol. 7 (2014), No. 5, 627-645. [<a href="http://dx.doi.org/10.2140/involve.2014.7.627">DOI</a>]
%t A255500 Table[(p^9+5p^8+4p^7-p^6-5p^5+2p^4)/6,{p,Prime[Range[20]]}] (* _Harvey P. Dale_, May 23 2020 *)
%o A255500 (Python)
%o A255500 from __future__ import division
%o A255500 from sympy import prime
%o A255500 A255500_list = []
%o A255500 for n in range(1,10**2):
%o A255500     p = prime(n)
%o A255500     A255500_list.append(p**4*(p*(p*(p*(p*(p + 5) + 4) - 1) - 5) + 2)//6)
%o A255500 # _Chai Wah Wu_, Mar 14 2015
%o A255500 (Sage)
%o A255500 def p(n): return nth_prime(n)
%o A255500 def A255500(n): return p(n)^4*(p(n)^5 +5*p(n)^4 +4*p(n)^3 -p(n)^2 -5*p(n) +2)/6
%o A255500 [A255500(n) for n in (1..30)] # _G. C. Greubel_, Sep 24 2021
%Y A255500 Cf. A229738, A229740, A255501.
%K A255500 nonn
%O A255500 1,1
%A A255500 _N. J. A. Sloane_, Mar 13 2015