login
A193710
T(n,k)=Number of arrays of -k..k integers x(1..n) with every x(i) being in a subsequence of length 1, 2, 3 or 4 with sum zero
8
1, 1, 3, 1, 5, 9, 1, 7, 23, 27, 1, 9, 43, 119, 73, 1, 11, 69, 309, 489, 195, 1, 13, 101, 629, 1565, 1987, 515, 1, 15, 139, 1111, 3617, 8281, 8043, 1357, 1, 17, 183, 1787, 6961, 23293, 43977, 32599, 3585, 1, 19, 233, 2689, 11913, 52551, 150639, 233983, 132713
OFFSET
1,3
COMMENTS
Table starts
....1......1.......1........1.........1.........1..........1..........1
....3......5.......7........9........11........13.........15.........17
....9.....23......43.......69.......101.......139........183........233
...27....119.....309......629......1111......1787.......2689.......3849
...73....489....1565.....3617......6961.....11913......18789......27905
..195...1987....8281....23293.....52551....102895.....182477.....300761
..515...8043...43977...150639....396849....883493....1749091....3175365
.1357..32599..233983...974609...2989013...7534239...16567391...32943665
.3585.132713.1246261..6275983..22245343..62963491..152394383..328701045
.9479.540913.6642635.40514073.166691719.533335257.1433139483.3387397649
LINKS
EXAMPLE
Some solutions for n=6 k=6
..5....6....0...-3....1...-4...-4....2...-1...-2...-6...-1....1...-4...-2...-5
.-4...-3...-4....4...-1....3....4...-4...-3....3...-1....5...-3....1...-3....0
.-6...-3....5...-1...-3....1....3....0....5...-3....3...-4...-2....3....5....4
..5....1...-1...-1....5....4...-6....2...-1....2....4...-4....4...-3....4....1
..2....0....0....1....1...-4...-1....4....1...-1...-2....5....3....0...-2...-5
.-1....2....0...-1...-3....4....1...-4....0....1...-5....3...-3....3...-2....0
CROSSREFS
Sequence in context: A129801 A240222 A193702 * A128821 A221446 A029723
KEYWORD
nonn,tabl
AUTHOR
R. H. Hardin Aug 02 2011
STATUS
approved