login
Maximum length of a composition of n such that every restriction to a subinterval has a different sum.
8

%I #6 May 14 2019 22:07:23

%S 0,1,1,2,2,2,3,3,3,3,3,4,4,4,4,4,4,5,5,5,5,5,5,5,5,6,6,6,6,6,6,6,6,6,

%T 7,7,7,7,7,7,7,7,7,7,8,8,8,8,8,8,8,8,8,8,8,9,9,9,9,9,9,9,9,9,9,9,9,9,

%U 9,9,9,9,10,10,10,10,10,10,10,10,10,10,10,10

%N Maximum length of a composition of n such that every restriction to a subinterval has a different sum.

%C A composition of n is a finite sequence of positive integers summing to n.

%C Also the maximum number of nonzero marks on a Golomb ruler of length n.

%F a(n) + 1 = A143824(n + 1).

%t Table[Max[Length/@Select[Join@@Permutations/@IntegerPartitions[n],UnsameQ@@ReplaceList[#,{___,s__,___}:>Plus[s]]&]],{n,0,15}]

%Y Run-lengths are A270813.

%Y Cf. A000079, A007318, A103295, A108917, A143823, A169942.

%Y Cf. A325466, A325676, A325677, A325679, A325681, A325683, A325687.

%K nonn

%O 0,4

%A _Gus Wiseman_, May 13 2019