A200181 T(n,k)=Number of -k..k arrays x(0..n-1) of n elements with zero sum and no two consecutive declines, no adjacent equal elements, and no element more than one greater than the previous (random base sawtooth pattern).
1, 1, 1, 1, 2, 3, 1, 3, 3, 3, 1, 4, 5, 6, 2, 1, 5, 5, 11, 12, 6, 1, 6, 7, 14, 15, 15, 10, 1, 7, 7, 19, 24, 29, 29, 7, 1, 8, 9, 26, 31, 48, 78, 72, 12, 1, 9, 9, 31, 48, 72, 100, 160, 133, 28, 1, 10, 11, 38, 53, 103, 186, 280, 283, 214, 29, 1, 11, 11, 47, 74, 141, 246, 460, 608, 574, 394
Offset: 1
Examples
Some solutions for n=7 k=6 ..2....6....3...-1....1....3....4....2....1....4....6....5....1....1....5....6 ..3....1....4....0....2....1....5....3....0....0....0....4....2....2....0...-1 ..1....2....2....1...-1....2....6....1....1....1....1....5....3....3....1....0 ..2....3....3....2....0....1...-4....2...-1...-1...-2...-4...-1...-2....2...-1 ..3...-4...-4...-1....1....2...-3...-3....0....0...-1...-3....0...-1...-2....0 .-6...-3...-3....0...-2...-5...-2...-2...-1....1....0...-2...-3...-2...-1....1 .-5...-5...-5...-1...-1...-4...-6...-3....0...-5...-4...-5...-2...-1...-5...-5
Links
- R. H. Hardin, Table of n, a(n) for n = 1..958
Crossrefs
Row 3 is A063196(n+2)
Comments