|
Search: id:A080432
|
|
|
| A080432 |
|
Even numbers such that all a(i)+a(j) are distinct. |
|
+0
2
|
|
| 2, 4, 6, 10, 16, 26, 42, 60, 78, 106, 148, 190, 256, 304, 364, 424, 516, 632, 748, 826, 952, 1062, 1092, 1216, 1434, 1596, 1724, 1930, 2120, 2322, 2614, 2772, 2870, 3112, 3444, 3668, 3868, 4116, 4522, 4994, 5398, 5748, 6122, 6394, 6664, 7258, 7424, 7736
(list; graph; listen)
|
|
|
OFFSET
|
1,1
|
|
|
MAPLE
|
sumset := {6}: keepA := array(1..10000): for m from 1 to 10000 do keepA[m] := 0 od: keepA[2] := 2: keepA[4] := 4: for n from 6 to 10000 by 2 do mytest := 0: for j from 2 to n-2 by 2 do if keepA[j]>0 then if member(keepA[j]+n, sumset) then mytest := 1; break; fi: fi: od: if mytest=0 then keepA[n] := n; for j from 2 to n-2 by 2 do sumset := sumset union {keepA[j]+n} od: fi: od: for i from 2 to 10000 by 2 do if keepA[i]>0 then printf(`%d, `, keepA[i]) fi: od:
|
|
CROSSREFS
|
Cf. A080430, A080431.
2 * A011185(n).
Sequence in context: A067247 A017985 A028488 this_sequence A094985 A128588 A023613
Adjacent sequences: A080429 A080430 A080431 this_sequence A080433 A080434 A080435
|
|
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
|
