login
This site is supported by donations to The OEIS Foundation.

 

Logo

Please make a donation to keep the OEIS running. We are now in our 55th year. In the past year we added 12000 new sequences and reached 8000 citations (which often say "discovered thanks to the OEIS"). We need to raise money to hire someone to manage submissions, which would reduce the load on our editors and speed up editing.
Other ways to donate

Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A064051 a(n) = 2*prime(n)^2 - prime(n+1)^2. 2
-1, -7, 1, -23, 73, 49, 217, 193, 217, 721, 553, 1057, 1513, 1489, 1609, 2137, 3241, 2953, 3937, 4753, 4417, 5593, 5857, 6433, 8617, 9793, 9769, 11017, 10993, 9409, 15097, 15553, 18217, 16441, 21601, 20953, 22729, 25249, 25849, 27817, 31321, 29041, 35713 (list; graph; refs; listen; history; text; internal format)
OFFSET

1,2

COMMENTS

Theorem: a(n) > 0 for all n > 4.

REFERENCES

D. S. Mitrinovic et al., Handbook of Number Theory, Kluwer, 1996, Section VII.18, p. 247.

LINKS

Harry J. Smith, Table of n, a(n) for n = 1..1000

MATHEMATICA

Table[2 Prime[n]^2 - Prime[n+1]^2, {n, 45}] (* Vincenzo Librandi, Jun 22 2018 *)

PROG

(PARI) a(n) = 2*prime(n)^2 - prime(n + 1)^2; \\ Harry J. Smith, Sep 06 2009

(MAGMA) [2*NthPrime(n)^2 - NthPrime(n+1)^2: n in [1..45]]; // Vincenzo Librandi, Jun 22 2018

CROSSREFS

Cf. A324798.

Sequence in context: A261248 A214686 A211790 * A147385 A147347 A183109

Adjacent sequences:  A064048 A064049 A064050 * A064052 A064053 A064054

KEYWORD

sign

AUTHOR

N. J. A. Sloane, Oct 15 2001

STATUS

approved

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

License Agreements, Terms of Use, Privacy Policy. .

Last modified December 13 22:55 EST 2019. Contains 329974 sequences. (Running on oeis4.)