The number of positive integer sequences of length n with no duplicate substrings (forward or backward) of length greater than 1 and a minimal product (= A282193(n)).
A284435
The number of positive integer sequences of length n with no duplicate substrings (forward or backward) of length greater than 1 and a minimal product (= A282193(n)).
Terms
- a(0) =1a(1) =1a(2) =2a(3) =2a(4) =4a(5) =4a(6) =4a(7) =48a(8) =144a(9) =144a(10) =144a(11) =2304a(12) =2160a(13) =8640a(14) =8640a(15) =8640a(16) =161280a(17) =806400a(18) =806400a(19) =806400a(20) =38534400a(21) =39168000a(22) =108864000a(23) =108864000a(24) =2794176000a(25) =5370624000a(26) =10741248000a(27) =21482496000a(28) =286355865600
External references
- oeis: A284435