|
Search: id:A080430
|
|
|
| A080430 |
|
Odd numbers such that all a(i)+ a(j) are distinct. |
|
+0
3
|
|
| 1, 3, 5, 9, 15, 25, 41, 59, 77, 105, 147, 189, 255, 303, 363, 423, 515, 631, 747, 825, 951, 1061, 1091, 1215, 1433, 1595, 1723, 1929, 2119, 2321, 2613, 2771, 2869, 3111, 3443, 3667, 3867, 4115, 4521, 4993, 5397, 5747, 6121, 6393, 6663, 7257, 7423, 7735, 8279
(list; graph; listen)
|
|
|
OFFSET
|
1,2
|
|
|
MAPLE
|
S := {4}: A := array(1..10^4): for m from 1 to 10^4 do A[m] := 0 od: A[1] := 1: A[3] := 3: for n from 5 to 10^4-1 by 2 do mytest := 0: for j from 1 to n-2 by 2 do if A[j]>0 then if member(A[j]+n, S) then mytest := 1; break; fi:fi:od: if mytest=0 then A[n] := n; for j from 1 to n-2 by 2 do S := S union {A[j]+n} od: fi: od: for i from 1 to 10^4-1 by 2 do if A[i]>0 then printf(`%d, `, A[i]) fi: od:
|
|
CROSSREFS
|
Cf. A080429.
Sequence in context: A135342 A029877 A128587 this_sequence A053523 A053522 A053521
Adjacent sequences: A080427 A080428 A080429 this_sequence A080431 A080432 A080433
|
|
KEYWORD
|
nonn
|
|
AUTHOR
|
Amarnath Murthy (amarnath_murthy(AT)yahoo.com), Feb 20 2003
|
|
EXTENSIONS
|
More terms and Maple code from James A. Sellers (sellersj(AT)math.psu.edu), Feb 26, 2003
|
|
|
Search completed in 0.002 seconds
|
