A193702 T(n,k)=Number of arrays of -k..k integers x(1..n) with every x(i) being in a subsequence of length 1, 2 or 3 with sum zero.
1, 1, 3, 1, 5, 9, 1, 7, 23, 23, 1, 9, 43, 83, 57, 1, 11, 69, 181, 299, 141, 1, 13, 101, 317, 827, 1081, 351, 1, 15, 139, 491, 1741, 3773, 3931, 875, 1, 17, 183, 703, 3141, 9385, 17197, 14293, 2181, 1, 19, 233, 953, 5127, 19301, 50035, 78407, 51955, 5435, 1, 21, 289, 1241
Offset: 1
Examples
Some solutions for n=7 k=6 .-2...-5...-3...-4...-1...-1...-4...-3...-3...-3...-5...-2...-2...-4...-5...-3 ..0....5....3....4....3....1....4...-1....4...-1....1....4....0....6....5....3 ..2...-5....1...-2...-2....0....5....4...-1....4....4...-2....2...-2....0....6 ..1....2....2....2...-6...-1...-6....0....1...-3...-3...-2...-5....2...-5...-6 .-3...-2...-3...-2....6...-5....1...-1...-2....2...-2...-2....5...-4....5....3 ..5....6....0....2...-6....6....3....4....1...-6....5....4....3....4...-2...-5 .-5...-4....0...-2....0...-6...-3...-3....0....4...-3....0...-3...-4...-3....2
Links
- R. H. Hardin, Table of n, a(n) for n = 1..1738
Comments