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!)
A098935 a(n) = p^7 - p^5 - p^3 - p^2 where p is prime(n). 0

%I #11 Oct 15 2023 11:58:58

%S 84,1908,74850,806344,19324668,62374858,408913614,891388420,

%T 3398376408,17229339930,27483954208,94862481154,194638347078,

%U 271671521308,506393669424,1174292792658,2487936351660,3141898009018,6059361174964,9093315566088,11045325053158

%N a(n) = p^7 - p^5 - p^3 - p^2 where p is prime(n).

%H Dario Alejandro Alpern, <a href="https://www.alpertron.com.ar/ECM.HTM">Factorization using Elliptic Curve Method</a>.

%e If p=2, 2^7 - 2^5 - 2^3 - 2^2 = 84.

%t Table[p = Prime[n]; p^7 - p^5 - p^3 - p^2, {n, 20}]

%Y Cf. A000040.

%K nonn

%O 1,1

%A _Parthasarathy Nambi_, Oct 20 2004

%E More terms from _Ray Chandler_, Nov 14 2004

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 19 15:11 EDT 2024. Contains 371794 sequences. (Running on oeis4.)