login
The OEIS is supported by the many generous donors to the OEIS Foundation.

 

Logo
Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A133064 a(n) = 5*p^5 + 3*p^3 + 2*p^2, where p = prime(n). 0

%I #16 Sep 08 2022 08:45:31

%S 192,1314,16050,85162,809490,1863394,7114602,12401794,32219274,

%T 102630594,143237050,346874482,579491130,735284434,1147040922,

%U 2091429714,3575244594,4223669890,6751536802,9022230570,10366535674,15386773594,19696932354,27922427994,42939458122,52553613810

%N a(n) = 5*p^5 + 3*p^3 + 2*p^2, where p = prime(n).

%F a(n) = 5*prime(n)^5 + 3*prime(n)^3 + 2*prime(n)^2, where prime(n)= A000040(n).

%e 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.

%t 5#^5+3#^3+2#^2&/@Prime[Range[30]] (* _Harvey P. Dale_, Dec 17 2011 *)

%o (Magma) [5*p^5+3*p^3+2*p^2: p in PrimesUpTo(200)] // _Vincenzo Librandi_, Dec 15 2010

%o (PARI) a(n) = my(p=prime(n)); 5*p^5 + 3*p^3 + 2*p^2; \\ _Michel Marcus_, Mar 11 2022

%Y Cf. A000290, A000578, A000584, A045991, A133073, A000040 (prime numbers).

%K nonn

%O 1,1

%A _Omar E. Pol_, Nov 05 2007

%E More terms from _Vincenzo Librandi_, Dec 15 2010

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Style Sheet | Transforms | Superseeker | Recents
The OEIS Community | Maintained by The OEIS Foundation Inc.

License Agreements, Terms of Use, Privacy Policy. .

Last modified April 20 00:58 EDT 2024. Contains 371798 sequences. (Running on oeis4.)