The number of positive integer sequences of length n with no duplicate substrings of length greater than 1, every number different from its neighbors, and a minimal product (= A282169(n)).
A284434
The number of positive integer sequences of length n with no duplicate substrings of length greater than 1, every number different from its neighbors, and a minimal product (= A282169(n)).
Terms
- a(0) =1a(1) =2a(2) =1a(3) =6a(4) =2a(5) =24a(6) =6a(7) =120a(8) =24a(9) =84a(10) =192a(11) =336a(12) =360a(13) =1680a(14) =2160a(15) =10080a(16) =26640a(17) =70560a(18) =80640a(19) =564480a(20) =645120a(21) =13789440a(22) =10644480a(23) =78382080a(24) =43545600a(25) =783820800a(26) =435456000a(27) =2264371200a(28) =12454041600a(29) =22643712000
External references
- oeis: A284434