A202076 T(n,k)=Number of arrays of n+2 integers in -k..k with sum zero and the sum of every adjacent pair being odd.
2, 4, 4, 10, 20, 2, 14, 56, 26, 0, 24, 120, 78, 0, 6, 30, 220, 264, 0, 96, 12, 44, 364, 504, 0, 1014, 524, 6, 52, 560, 1128, 0, 3752, 5832, 726, 0, 70, 816, 1786, 0, 15010, 34632, 8412, 0, 20, 80, 1140, 3262, 0, 35604, 142692, 80812, 0, 2760, 40, 102, 1540, 4660, 0, 95342
Offset: 1
Examples
Some solutions for n=3 k=3 ..0....0....0....2....2....0....2....2....0....0....0...-2....2....0...-2...-2 ..1...-1....3....1...-1....1....1...-1....1...-1...-1....3...-3...-3....3....3 .-2...-2...-2...-2....0....2....0....0....0....2....0...-2....2....2...-2....0 ..1....1...-3...-3....1...-3...-1...-3...-3...-1....3....3...-3...-1...-1...-3 ..0....2....2....2...-2....0...-2....2....2....0...-2...-2....2....2....2....2
Links
- R. H. Hardin, Table of n, a(n) for n = 1..9999
Comments