Number of subsequences of {1..n} such that all differences of pairs of terms are distinct (i.e., number of Golomb rulers on {1..n}).

A054578

Number of subsequences of {1..n} such that all differences of pairs of terms are distinct (i.e., number of Golomb rulers on {1..n}).

Terms

    a(0) =1a(1) =3a(2) =6a(3) =12a(4) =21a(5) =35a(6) =56a(7) =90a(8) =139a(9) =215a(10) =316a(11) =462a(12) =667a(13) =961a(14) =1358a(15) =1918a(16) =2665a(17) =3693a(18) =5034a(19) =6844a(20) =9187a(21) =12365a(22) =16416a(23) =21786a(24) =28707a(25) =37721a(26) =49082a(27) =63920a(28) =82639a(29) =106721

External references