This is a front-end for the Online Encyclopedia of Integer Sequences, made by Christian Perfect. The idea is to provide OEIS entries in non-ancient HTML, and then to think about how they're presented visually. The source code is on GitHub.
%I A080432 #11 Jul 02 2025 16:02:01
%S A080432 2,4,6,10,16,26,42,60,78,106,148,190,256,304,364,424,516,632,748,826,
%T A080432 952,1062,1092,1216,1434,1596,1724,1930,2120,2322,2614,2772,2870,3112,
%U A080432 3444,3668,3868,4116,4522,4994,5398,5748,6122,6394,6664,7258,7424,7736
%N A080432 Even numbers such that all a(i) + a(j) are distinct.
%p A080432 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: # _James Sellers_, Feb 26 2003
%Y A080432 Cf. A080430, A080431.
%Y A080432 2 * A011185(n).
%K A080432 nonn
%O A080432 1,1
%A A080432 _Amarnath Murthy_, Feb 20 2003
%E A080432 More terms from _James Sellers_, Feb 26 2003