|
Search: id:A062064
|
|
|
| A062064 |
|
a(1) = 2; a(n) is the smallest prime > a(n-1) such that a(n) + a(n-1) is a square. |
|
+0
4
|
|
| 2, 7, 29, 71, 73, 251, 773, 827, 937, 1367, 1549, 5507, 7489, 8387, 8513, 10531, 11969, 16931, 18413, 18451, 20753, 21683, 24113, 25171, 26813, 27011, 29633, 33871, 63473, 76403, 77261, 89203, 222161, 229423, 254993, 266291, 278353
(list; graph; listen)
|
|
|
OFFSET
|
1,1
|
|
|
LINKS
|
Harry J. Smith, Table of n, a(n) for n=1,...,1000
|
|
EXAMPLE
|
The next term after 7 is 29 as 7 + 29 = 36 = 6^2.
|
|
PROGRAM
|
(PARI) { a=2; for (n=1, 1000, a1=a; if (n>1, until (issquare(a + a1), a=nextprime(a + 1))); write("b062064.txt", n, " ", a) ) } [From Harry J. Smith (hjsmithh(AT)sbcglobal.net), Jul 31 2009]
|
|
CROSSREFS
|
Cf. A062066.
Sequence in context: A116968 A162172 A083016 this_sequence A158024 A166940 A166939
Adjacent sequences: A062061 A062062 A062063 this_sequence A062065 A062066 A062067
|
|
KEYWORD
|
nonn,easy
|
|
AUTHOR
|
Amarnath Murthy (amarnath_murthy(AT)yahoo.com), Jun 12 2001
|
|
EXTENSIONS
|
More terms from Larry Reeves (larryr(AT)acm.org), Jun 21 2001
|
|
|
Search completed in 0.002 seconds
|
