|
Search: id:A105318
|
|
|
| A105318 |
|
Starting prime for the smallest prime Pythagorean sequence for n triangles. |
|
+0
2
|
|
| 3, 271, 169219, 356498179, 2500282512131, 20594058719087111, 2185103796349763249
(list; graph; listen)
|
|
|
OFFSET
|
2,1
|
|
|
COMMENT
|
Smallest prime p(0) such that the n-chain governed by recurrence p(i+1)=(p(i)^2 + 1)/2 are all primes. Equivalently, least prime p(0) that generates a sequence of n 2-prime triangles, where p(k) is the hypotenuse of the k-th triangle and the leg of the (k+1)-th triangle.
|
|
LINKS
|
H. Dubner, Posting to Number Theory List
T. Forbes, Posting to Number Theory List
H. Dubner & T. Forbes, Prime Pythagorean Triangles
T. Forbes, Posting to Number Theory List
H. Dubner & T. Forbes, Journal of Integer Sequences, Vol. 4(2001) #01.2.3, Prime Pythagorean triangles
C. K. Caldwell, The Prime Glossary, Pythagorean triples
|
|
CROSSREFS
|
Cf. A048270; A048295.
Sequence in context: A003381 A058451 A003761 this_sequence A115477 A051365 A003706
Adjacent sequences: A105315 A105316 A105317 this_sequence A105319 A105320 A105321
|
|
KEYWORD
|
hard,more,nonn
|
|
AUTHOR
|
Lekraj Beedassy (blekraj(AT)yahoo.com), Apr 26 2005
|
|
|
Search completed in 0.002 seconds
|
