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!)
A133061 5*p^5 - 3*p^3 - 2*p^2, where p = prime(n). 1

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

%S 128,1116,15200,82908,801020,1849536,7083968,12359196,32144156,

%T 102480896,143054460,346565088,579070880,734799996,1146409148,

%U 2090525216,3573998396,4222293120,6749714268,9020062940,10364180256,15383790396,19693474076,27918166496,42933944448,52547391200

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

%H G. C. Greubel, <a href="/A133061/b133061.txt">Table of n, a(n) for n = 1..1000</a>

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

%e a(4)=82908 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=82908.

%t Table[(Prime[n])^2*(5*Prime[n]^3 - 3*Prime[n] - 2), {n, 1, 50}] (* _G. C. Greubel_, Oct 09 2017 *)

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

%o (PARI) for(n=1,25, print1(5*prime(n)^5 - 3*prime(n)^3 - 2*prime(n)^2, ", ")) \\ _G. C. Greubel_, Oct 09 2017

%Y Cf. A000290, A000578, A000584, A045991, A133070. Prime numbers: A000040.

%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 24 04:14 EDT 2024. Contains 371918 sequences. (Running on oeis4.)