login

Year-end appeal: Please make a donation to the OEIS Foundation to support ongoing development and maintenance of the OEIS. We are now in our 61st year, we have over 378,000 sequences, and we’ve reached 11,000 citations (which often say “discovered thanks to the OEIS”).

A133064
a(n) = 5*p^5 + 3*p^3 + 2*p^2, where p = prime(n).
0
192, 1314, 16050, 85162, 809490, 1863394, 7114602, 12401794, 32219274, 102630594, 143237050, 346874482, 579491130, 735284434, 1147040922, 2091429714, 3575244594, 4223669890, 6751536802, 9022230570, 10366535674, 15386773594, 19696932354, 27922427994, 42939458122, 52553613810
OFFSET
1,1
FORMULA
a(n) = 5*prime(n)^5 + 3*prime(n)^3 + 2*prime(n)^2, where prime(n)= A000040(n).
EXAMPLE
a(4)=85162 because the 4th prime is 7, 5*7^5=84035, 3*7^3=1029, 2*7^2=98 and we can write 84035 + 1029 + 98 = 85162.
MATHEMATICA
5#^5+3#^3+2#^2&/@Prime[Range[30]] (* Harvey P. Dale, Dec 17 2011 *)
PROG
(Magma) [5*p^5+3*p^3+2*p^2: p in PrimesUpTo(200)] // Vincenzo Librandi, Dec 15 2010
(PARI) a(n) = my(p=prime(n)); 5*p^5 + 3*p^3 + 2*p^2; \\ Michel Marcus, Mar 11 2022
CROSSREFS
Cf. A000290, A000578, A000584, A045991, A133073, A000040 (prime numbers).
Sequence in context: A205768 A205761 A346251 * A183685 A254846 A051526
KEYWORD
nonn
AUTHOR
Omar E. Pol, Nov 05 2007
EXTENSIONS
More terms from Vincenzo Librandi, Dec 15 2010
STATUS
approved