A190071 T(n,k)=Number of arrangements of n+1 nonzero numbers x(i) in -k..k with the sum of div(x(i),x(i+1)), where div(a,b)=a/b produces the integer quotient implying a nonnegative remainder, equal to zero.
0, 2, 4, 6, 12, 0, 12, 36, 40, 12, 20, 76, 166, 144, 0, 30, 143, 483, 922, 550, 40, 42, 233, 1126, 3481, 5136, 1896, 0, 56, 366, 2276, 9904, 25306, 28656, 7584, 140, 72, 536, 4150, 23400, 88509, 191456, 162028, 27328, 0, 90, 760, 6946, 48491, 249119, 834717
Offset: 1
Examples
Some solutions for n=6 k=4 .-3...-4....2....1....3...-3...-4....1....2...-1...-3....2...-1....1....2...-2 .-1...-4...-4...-3...-2...-2...-2...-2...-3...-1...-1...-1...-2...-2...-3...-4 ..3....2....1....2....4....1....4...-2...-2...-3....1....3...-3....3...-2...-2 .-1....2....1....4....2...-2...-3....2....4....1....2....3...-2....1...-3....1 .-1....4...-2....3...-1....3....3...-4...-1....2....3...-4....2...-2....2....3 ..4....3...-1....4...-3....2....3...-4...-4....2...-4...-4...-1....3....4....2 ..3...-2...-1....3...-3...-3....4....4...-3....4....3...-4....1...-3...-3...-1
Links
- R. H. Hardin, Table of n, a(n) for n = 1..793
Comments