a(1) = 1; for n > 1, a(n) = smallest number > a(n-1) such that pairwise sums and (absolute) differences of distinct elements are all distinct.

A126428

a(1) = 1; for n > 1, a(n) = smallest number > a(n-1) such that pairwise sums and (absolute) differences of distinct elements are all distinct.

Terms

    a(0) =1a(1) =2a(2) =6a(3) =12a(4) =21a(5) =37a(6) =58a(7) =84a(8) =112a(9) =129a(10) =173a(11) =213a(12) =266a(13) =307a(14) =373a(15) =446a(16) =513a(17) =589a(18) =639a(19) =829a(20) =916a(21) =1061a(22) =1209a(23) =1297a(24) =1429a(25) =1461a(26) =1626a(27) =1783a(28) =1964a(29) =2220

External references