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 sum (= A282166(n)).
A284431
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 sum (= A282166(n)).
Terms
- a(0) =1a(1) =2a(2) =1a(3) =6a(4) =2a(5) =42a(6) =12a(7) =116a(8) =18a(9) =84a(10) =168a(11) =336a(12) =384a(13) =6864a(14) =7872a(15) =67392a(16) =52800a(17) =357120a(18) =115200a(19) =748800a(20) =3093120a(21) =11681280a(22) =26853120a(23) =43130880a(24) =74649600a(25) =2238382080a(26) =3588157440a(27) =51775856640a(28) =63188398080a(29) =653811056640
External references
- oeis: A284431