|
Search: id:A064819
|
|
|
| A064819 |
|
p(1)*p(2)*...*p(n) - p(n+1)^2, where p(i) = i-th prime. |
|
+0
2
|
|
| -7, -19, -19, 89, 2141, 29741, 510149, 9699161, 223092029, 6469692269, 200560488761, 7420738133129, 304250263525361, 13082761331667821, 614889782588488601, 32589158477190041249, 1922760350154212635349, 117288381359406970978781
(list; graph; listen)
|
|
|
OFFSET
|
1,1
|
|
|
COMMENT
|
It is known that a(n) > 0 for n >= 4.
|
|
REFERENCES
|
S. Bulman-Fleming and E. T. H. Wang, Problem 356, College Math. J., 20 (1989), 265.
R. Honsberger, Mathematical Diamonds, MAA, 2003, see p. 79. [Added by N. J. A. Sloane, Jul 05 2009]
H. Rademacher & O. Toeplitz, The Enjoyment of Mathematics, pp. 187-192 Dover NY 1990.
J. V. Uspensky and M. A. Heaslet, Elementary Number Theory, McGraw-Hill, NY, 1939.
|
|
LINKS
|
Harry J. Smith, Table of n, a(n) for n=1,...,100
|
|
PROGRAM
|
(PARI) { p=1; for (n=1, 100, p*=prime(n); write("b064819.txt", n, " ", p - prime(n + 1)^2) ) } [From Harry J. Smith (hjsmithh(AT)sbcglobal.net), Sep 27 2009]
|
|
CROSSREFS
|
Cf. A135734, A060882.
Sequence in context: A070414 A125257 A052256 this_sequence A102167 A109637 A039513
Adjacent sequences: A064816 A064817 A064818 this_sequence A064820 A064821 A064822
|
|
KEYWORD
|
sign
|
|
AUTHOR
|
N. J. A. Sloane (njas(AT)research.att.com), Oct 23 2001
|
|
|
Search completed in 0.002 seconds
|
