A051788 a(1) = 1, a(2) = 3; for n>2, a(n) = least value > a(n-1) such that pairwise differences are unique.

1, 3, 4, 8, 14, 22, 31, 46, 62, 82, 108, 137, 149, 171, 206, 259, 303, 367, 414, 479, 545, 578, 658, 728, 848, 921, 1004, 1130, 1268, 1352, 1454, 1584, 1669, 1876, 1915, 2114, 2303, 2404, 2563, 2797, 2991, 3112, 3270, 3423, 3592, 3773, 3889, 4284, 4727, 4819

Offset

1,2

Comments

A variation on A005282 (Mian-Chowla, where sums of pairs of elements are unique).

Links

Adam Reichert, Table of n, a(n) for n = 1..10000

Adam Reichert, Python

Crossrefs

Cf. A005282, A080201 (for differences that do not occur).

Sequence in context: A310012 A181408 A004979 * A023623 A023558 A170902

Adjacent sequences: A051785 A051786 A051787 * A051789 A051790 A051791

Keyword

nonn

Author

Gerald A. Mischke (Gerald.Mischke(AT)mutualofomaha.com), Dec 09 1999

Status

approved