A199704 T(n,k)=Number of -k..k arrays x(0..n-1) of n elements with zero sum and no two neighbors equal.
1, 1, 2, 1, 4, 6, 1, 6, 14, 8, 1, 8, 32, 52, 14, 1, 10, 52, 168, 200, 32, 1, 12, 82, 380, 892, 708, 56, 1, 14, 114, 724, 2734, 4964, 2642, 100, 1, 16, 156, 1236, 6504, 20116, 27854, 10000, 204, 1, 18, 200, 1940, 13324, 59992, 149942, 156920, 37984, 388, 1, 20, 254
Offset: 1
Examples
Some solutions for n=6 k=5 ..0....5....1...-4...-2....1...-1...-5....4....0....3....0....2....2...-5...-1 ..5...-1....0....5...-5...-1...-2....4...-1....2...-1....4....3...-3....0....3 .-1...-3...-1....3....4....0...-5....2...-5...-1...-5....3...-4....4...-3....1 .-5...-5....3...-5...-4....1....0...-5....3....0....3...-1...-1...-3....5....4 ..4....4....0....0....2....2....3...-1....1....1....2...-2...-3...-5....0...-5 .-3....0...-3....1....5...-3....5....5...-2...-2...-2...-4....3....5....3...-2
Links
- R. H. Hardin, Table of n, a(n) for n = 1..914
Comments