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

Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A064051 2*p(n)^2 - p(n+1)^2, where p(i) = i-th prime. 1
-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 (list; graph; refs; listen; history; 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, Section VII.18, p. 493.

LINKS

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

PROG

(PARI) { for (n=1, 1000, write("b064051.txt", n, " ", 2*prime(n)^2 - prime(n + 1)^2) ) } [From Harry J. Smith (hjsmithh(AT)sbcglobal.net), Sep 06 2009]

CROSSREFS

Sequence in context: A050310 A178445 A019431 * A147385 A147347 A183109

Adjacent sequences:  A064048 A064049 A064050 * A064052 A064053 A064054

KEYWORD

sign

AUTHOR

N. J. A. Sloane (njas(AT)research.att.com), Oct 15 2001

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Transforms | Puzzles | Hot | Classics
Recent Additions | More pages | Superseeker | Maintained by The OEIS Foundation Inc.

Content is available under The OEIS End-User License Agreement .

Last modified February 17 11:46 EST 2012. Contains 206011 sequences.