A200192 T(n,k)=Number of -k..k arrays x(0..n-1) of n elements with zero sum, adjacent elements differing by more than one, and elements alternately increasing and decreasing.
1, 1, 2, 1, 4, 0, 1, 6, 6, 2, 1, 8, 14, 14, 0, 1, 10, 28, 48, 24, 2, 1, 12, 44, 120, 144, 54, 0, 1, 14, 66, 242, 506, 482, 104, 2, 1, 16, 90, 426, 1298, 2240, 1534, 230, 0, 1, 18, 120, 688, 2794, 7266, 9856, 5148, 464, 2, 1, 20, 152, 1040, 5300, 18838, 40632, 44562, 16826
Offset: 1
Examples
Some solutions for n=6 k=5 .-4....0....5....2....4...-4....5....4....1....4....1...-3...-3...-1....4....0 ..3....3...-4....4...-3....2...-5...-2...-3...-3...-1....5....0....3...-3...-2 .-4...-4....1...-5....5...-2....4....1....3....3....3...-5...-3...-1....0....3 ..2....2...-4....1...-5....4...-5...-2...-1...-4...-4....5....5....1...-2...-2 ..0...-5....4...-5....4...-3....4....3....1....4....5...-2...-3...-2....2....4 ..3....4...-2....3...-5....3...-3...-4...-1...-4...-4....0....4....0...-1...-3
Links
- R. H. Hardin, Table of n, a(n) for n = 1..871
Crossrefs
Row 3 is A139596(n-1)
Comments