A221459 T(n,k)=Number of 0..k arrays of length n with each element unequal to at least one neighbor, with new values introduced in 0..k order.
0, 0, 1, 0, 1, 1, 0, 1, 2, 2, 0, 1, 2, 6, 3, 0, 1, 2, 7, 16, 5, 0, 1, 2, 7, 24, 44, 8, 0, 1, 2, 7, 25, 88, 120, 13, 0, 1, 2, 7, 25, 101, 328, 328, 21, 0, 1, 2, 7, 25, 102, 436, 1235, 896, 34, 0, 1, 2, 7, 25, 102, 455, 1971, 4668, 2448, 55, 0, 1, 2, 7, 25, 102, 456, 2192, 9159, 17675
Offset: 1
Examples
Some solutions for n=6 k=4 ..0....0....0....0....0....0....0....0....0....0....0....0....0....0....0....0 ..1....1....1....1....1....1....1....1....1....1....1....1....1....1....1....1 ..2....2....2....2....1....0....0....2....2....2....1....1....2....2....2....1 ..3....3....1....2....2....2....2....3....2....1....2....2....2....0....1....0 ..4....3....0....1....2....0....3....1....3....3....0....3....0....2....2....1 ..1....4....3....3....3....3....2....0....1....0....1....2....3....1....1....0
Links
- R. H. Hardin, Table of n, a(n) for n = 1..2080
Comments