|
Search: id:A066326
|
|
|
| A066326 |
|
a(1) = 5; for n>1 a(n) is the smallest number such that a(n)<>a(x) for any x<n and for every a(n) there exist a(m) so that (a(m),a(n),sqrt(a(n)^2+a(m)^2)) is a Pythagorean triple. |
|
+0
1
|
|
| 5, 12, 9, 16, 30, 35, 40, 42, 56, 33, 44, 63, 60, 11, 25, 32, 24, 7, 10, 18, 45, 28, 21, 20, 15, 8, 6, 36, 27, 48, 14, 55, 64, 70, 72, 54, 65, 75, 77, 80, 39, 52, 84, 13, 90, 91, 96, 99, 100, 105, 88, 66, 108, 81, 110, 112, 117, 120, 22, 50, 119, 126, 128, 132, 85, 135, 140
(list; graph; listen)
|
|
|
OFFSET
|
1,1
|
|
|
COMMENT
|
For a(1) = 0,1,2 no possible value of a(2) exists; for a(1) = 3,4 we get 4, 3 for a(2) but no further possible values. For a(1) >= 5 do we always get an infinite sequence?
|
|
EXAMPLE
|
a(5) = 30 because a(5)^2 + a(4)^2 = 30^2 + 16^2 = 34^2; a(6) = 35 because a(6)^2 + a(2)^2 = 35^2 + 12^2 = 37^2
|
|
CROSSREFS
|
Sequence in context: A046610 A009842 A070368 this_sequence A015242 A009415 A076537
Adjacent sequences: A066323 A066324 A066325 this_sequence A066327 A066328 A066329
|
|
KEYWORD
|
nonn
|
|
AUTHOR
|
Jonathan Ayres (jonathan.ayres(AT)ntlworld.com), Dec 15 2001
|
|
|
Search completed in 0.002 seconds
|
