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!)
A138410 a(n) = prime(n)^6 - prime(n)^3. 3

%I #13 Sep 08 2022 08:45:33

%S 56,702,15500,117306,1770230,4824612,24132656,47039022,148023722,

%T 594798932,887473890,2565675756,4750035320,6321283542,10779111506,

%U 22164212252,42180328262,51520147380,90458081406,128099926010

%N a(n) = prime(n)^6 - prime(n)^3.

%H Vincenzo Librandi, <a href="/A138410/b138410.txt">Table of n, a(n) for n = 1..200</a>

%H <a href="/index/Pri#prime_powers">Index to sequences related to prime powers</a>

%t a = {}; Do[p = Prime[n]; AppendTo[a, p^6 - p^3], {n, 1, 50}]; a

%o (PARI) forprime(p=2,1e3,print1(p^6-p^3", ")) \\ _Charles R Greathouse IV_, Jun 16 2011

%o (Magma) [NthPrime((n))^6 - NthPrime((n))^3: n in [1..30] ]; // _Vincenzo Librandi_, Jun 17 2011

%K nonn,easy

%O 1,1

%A _Artur Jasinski_, Mar 19 2008

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 July 30 12:09 EDT 2024. Contains 374743 sequences. (Running on oeis4.)