A202252 T(n,k)=Number of zero-sum -k..k arrays of n elements with adjacent element differences also in -k..k.
1, 1, 1, 1, 3, 3, 1, 3, 9, 7, 1, 5, 17, 31, 15, 1, 5, 27, 81, 107, 33, 1, 7, 41, 171, 397, 387, 75, 1, 7, 57, 309, 1077, 2003, 1415, 171, 1, 9, 75, 509, 2385, 6963, 10239, 5231, 391, 1, 9, 97, 779, 4643, 18841, 45523, 52697, 19477, 899, 1, 11, 121, 1133, 8211, 43293, 150523
Offset: 1
Examples
Some solutions for n=6 k=7 ..0...-4....6....0...-3....0....2...-7....3...-3....0....5....3....0...-2...-4 ..4...-1....0....3...-5....7...-1...-1...-4...-6...-6....4....1....6...-4...-1 ..4...-1...-2....0...-4....0....4...-1...-2....0....1....3...-2....3....0....1 .-3....1...-3....4....2...-1....1....4...-3....6...-1...-2...-3...-4....6....6 ..1....0....0...-1....3...-3...-1....0....1....4....2...-4...-1...-2...-1....0 .-6....5...-1...-6....7...-3...-5....5....5...-1....4...-6....2...-3....1...-2
Links
- R. H. Hardin, Table of n, a(n) for n = 1..9999
Crossrefs
Column 1 is A136029
Comments