a(n) is the smallest integer k such that [1,2,...,k] contains a set of n but no more disjoint consecutive subsequences, each having element sum k.

A378718

a(n) is the smallest integer k such that [1,2,...,k] contains a set of n but no more disjoint consecutive subsequences, each having element sum k.

Terms

    a(0) =1a(1) =3a(2) =15a(3) =27a(4) =75a(5) =165a(6) =345a(7) =315a(8) =693a(9) =945a(10) =1365a(11) =2457a(12) =2835a(13) =4455a(14) =3465a(15) =4095a(16) =7245a(17) =15435a(18) =12285a(19) =10395a(20) =17325a(21) =27405a(22) =24255a(23) =29925a(24) =31185a(25) =48195a(26) =70875a(27) =45045a(28) =58905a(29) =61425

External references