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”).

A199913
Number of -n..n arrays x(0..5) of 6 elements with zero sum, and adjacent elements not equal modulo three (with -1 modulo 3 = 2)
1
32, 232, 1312, 5016, 12872, 29864, 62776, 114768, 200520, 335216, 522160, 792880, 1174320, 1666712, 2327312, 3198184, 4271544, 5640984, 7367048, 9427264, 11963896, 15059328, 18668000, 22994912, 28147648, 34047432, 40977792, 49074872
OFFSET
1,1
COMMENTS
Row 6 of A199909
LINKS
FORMULA
Empirical: a(n) = 2*a(n-1) -a(n-2) +4*a(n-3) -8*a(n-4) +4*a(n-5) -6*a(n-6) +12*a(n-7) -6*a(n-8) +4*a(n-9) -8*a(n-10) +4*a(n-11) -a(n-12) +2*a(n-13) -a(n-14)
EXAMPLE
Some solutions for n=6
.-1....2....5...-1...-4...-5...-3....4....2...-1...-5....0...-2...-2...-5....3
.-5....3....4....1....6....2....1...-1...-5...-3....5....5....3....0....3....4
.-1....4....5...-4....1....1....2....0....5....4...-2....1...-2...-4...-2....0
..0...-4...-3....3...-4....3....3...-4...-6...-4....0...-6....0....4....3...-1
..1...-3...-5...-5....6...-1....1....6....1....3....5....4...-2...-4...-5...-5
..6...-2...-6....6...-5....0...-4...-5....3....1...-3...-4....3....6....6...-1
CROSSREFS
Sequence in context: A022146 A160061 A269585 * A301795 A301968 A208641
KEYWORD
nonn
AUTHOR
R. H. Hardin Nov 11 2011
STATUS
approved