The number of positive integer sequences of length n with no duplicate substrings of length greater than 1 and a minimal sum (= A259280(n)).

A283558

The number of positive integer sequences of length n with no duplicate substrings of length greater than 1 and a minimal sum (= A259280(n)).

Terms

    a(0) =1a(1) =1a(2) =3a(3) =2a(4) =2a(5) =6a(6) =6a(7) =48a(8) =60a(9) =168a(10) =144a(11) =288a(12) =1872a(13) =3744a(14) =5760a(15) =11520a(16) =161280a(17) =322560a(18) =1866240a(19) =2903040a(20) =10782720a(21) =8294400a(22) =24883200a(23) =282009600a(24) =846028800a(25) =3060633600a(26) =9181900800a(27) =10450944000a(28) =31352832000a(29) =668860416000

External references