login

Year-end appeal: Please make a donation to the OEIS Foundation to support ongoing development and maintenance of the OEIS. We are now in our 61st year, we have over 378,000 sequences, and we’ve reached 11,000 citations (which often say “discovered thanks to the OEIS”).

A193707
Number of arrays of -5..5 integers x(1..n) with every x(i) in a subsequence of length 1, 2, 3 or 4 with sum zero
1
1, 11, 101, 1111, 6961, 52551, 396849, 2989013, 22245343, 166691719, 1248626317, 9348231385, 69979015481, 523959788091, 3922930719919, 29370668470793, 219896678916165, 1646364342879165, 12326287592918831, 92286557411926649
OFFSET
1,2
COMMENTS
Column 5 of A193710
LINKS
EXAMPLE
Some solutions for n=6
..3...-5....3....0...-3....2....4...-1....3...-2...-4....0...-4....2....0...-5
.-4....4...-4....2....5...-2....1....1...-3....2....4...-1....1...-2....1....5
.-2....1...-4...-2...-4...-3...-4....3....0....2...-3...-2....1....0...-1...-5
..3...-5....5....2....2....2...-1...-3...-4....2...-1....5....2....2....4....1
.-5....2....3...-4...-1....1...-1...-3....3....1....4...-2....2....0...-4....0
..2....2....0....2...-1....0....2....3....1...-5...-4...-3...-5...-2....4...-1
CROSSREFS
Sequence in context: A289531 A288825 A290111 * A006943 A073030 A290295
KEYWORD
nonn
AUTHOR
R. H. Hardin Aug 02 2011
STATUS
approved