|
Search: id:A064051
|
|
|
| A064051 |
|
2*p(n)^2 - p(n+1)^2, where p(i) = i-th prime. |
|
+0
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; listen)
|
|
|
OFFSET
|
1,2
|
|
|
COMMENT
|
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
|
|
PROGRAM
|
(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: A119546 A050310 A019431 this_sequence A147385 A147347 A082172
Adjacent sequences: A064048 A064049 A064050 this_sequence A064052 A064053 A064054
|
|
KEYWORD
|
sign
|
|
AUTHOR
|
N. J. A. Sloane (njas(AT)research.att.com), Oct 15 2001
|
|
|
Search completed in 0.002 seconds
|
