The number of positive integer sequences of length n with no duplicate substrings (forward or backward) of length greater than 1, every number different from its neighbors, and a minimal sum (= A282167(n)).
A284433
The number of positive integer sequences of length n with no duplicate substrings (forward or backward) of length greater than 1, every number different from its neighbors, and a minimal sum (= A282167(n)).
Terms
- a(0) =1a(1) =2a(2) =6a(3) =2a(4) =18a(5) =12a(6) =24a(7) =24a(8) =1320a(9) =240a(10) =528a(11) =720a(12) =5664a(13) =105888a(14) =16992a(15) =150048a(16) =244800a(17) =4266432a(18) =4375296a(19) =39598848a(20) =50637312a(21) =123310080a(22) =202549248a(23) =15925690368a(24) =3765657600a(25) =23454351360a(26) =101739110400a(27) =437749678080
External references
- oeis: A284433