A188358 T(n,k)=Number of arrangements of n+1 numbers x(i) in -k..k with the sum of x(i)*x(i+1) equal to zero.
5, 9, 15, 13, 45, 29, 17, 91, 117, 91, 21, 153, 257, 565, 197, 25, 231, 497, 1775, 1953, 627, 29, 325, 749, 4201, 7369, 9153, 1477, 33, 435, 1205, 8051, 22229, 49747, 37269, 4671, 37, 561, 1569, 14477, 45801, 181449, 262925, 173409, 11693, 41, 703, 2161
Offset: 1
Examples
Some solutions for n=6 k=4 .-4...-1...-4....0....3....0...-1....0...-4...-1...-1...-1...-2...-1....1...-3 ..0...-2...-3...-2...-4...-4...-3...-4....0...-1...-2...-3...-2....0...-2...-1 .-4....2....3....1....3....4...-3...-1....4....0....1....1...-2....4....1....1 ..4...-1...-1....1....3....4....0...-2....0....0...-3...-4....1...-4...-4....2 ..4....2....2....1....1....0....1....3...-2...-3...-1...-1...-2...-4....3...-3 ..3....1...-2....0...-4....1...-3...-2....0...-1....0....2....1...-4....4...-1 .-4....4...-3...-1...-4....0....3...-3...-4....4....3....1...-2....4....2....1
Links
- R. H. Hardin, Table of n, a(n) for n = 1..178
Comments