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

A283557

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

Terms

    a(0) =1a(1) =1a(2) =3a(3) =2a(4) =2a(5) =6a(6) =6a(7) =24a(8) =24a(9) =120a(10) =120a(11) =1200a(12) =1440a(13) =4320a(14) =4320a(15) =8640a(16) =30240a(17) =60480a(18) =483840a(19) =967680a(20) =1935360a(21) =3870720a(22) =17418240a(23) =34836480a(24) =348364800a(25) =696729600a(26) =1741824000a(27) =3483648000a(28) =19160064000a(29) =38320128000

External references