OFFSET
1,2
COMMENTS
s={1,2,6}, 1+2+6=9=3^2. Then select the least three numbers a<b<c, such that all a, b, c are absent in s and a+b+c=d^2, a perfect square. Join s and {a,b,c}, repeat procedure. Numbers r which retain their position (that is, s[[r]]=r): 1,2,24,51,60,69,102,168,216,393,882. Also, no finite subset of length t is a permutation of {1..t}.
EXAMPLE
1+2+6=9, 3+4+9=16, 5+7+13=25, 8+10+18=36, 11+12+26=49,14+15+20=49.
MATHEMATICA
s={}; ra=Range[2000]; Do[su=ra[[1]]+ra[[2]]; c=3; While[ !IntegerQ[Sqrt[su+ra[[c]]]], c++ ]; rac=ra[[c]]; s=Join[s, {ra[[1]], ra[[2]], rac}]; ra=Complement[ra, {ra[[1]], ra[[2]], rac}], {334}]; s
CROSSREFS
KEYWORD
nonn
AUTHOR
Zak Seidov, May 08 2007
STATUS
approved