OFFSET
1,1
COMMENTS
Let S consist of integers x such that x is a term of a primitive Pythagorean triple (ppt). Consider the equivalence classes induced on S by this relation: x and y are equivalent if some ppt includes both x and y. For each class E, let x(E) be the least number in E. Then (a(n)) is the result of arranging the numbers x(E) in increasing order. The terms of S can be represented as nodes of a disconnected graph whose components match the classes C. For example, the component represented by a(1) = 3 starts with
. . . . . . . . . 3
. . . . . . . . / ... \
. . . . . . . 4 ------- 5
. . . . . . . . . . . /...\
. . . . . . . . . . 12 -----13
. . . . . . . . . ./...\ .. /..\
. . . . . . . . . 35---37..84--85
- Clark Kimberling, Nov 14 2013
LINKS
Ray Chandler, Table of n, a(n) for n = 1..10000
CROSSREFS
KEYWORD
nonn
AUTHOR
Lekraj Beedassy, Dec 30 2005
EXTENSIONS
Corrected and extended by Ray Chandler, Jan 02 2006
STATUS
approved