|
|
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
|
|
|
FORMULA
|
|
|
MATHEMATICA
|
2#[[1]]-#[[2]]&/@Partition[Prime[Range[50]]^2, 2, 1] (* Harvey P. Dale, May 15 2023 *)
|
|
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
|
|
|
KEYWORD
|
sign
|
|
AUTHOR
|
|
|
STATUS
|
approved
|
|
|
|