cp's OEIS Frontend

A199532 Number of -n..n arrays x(0..4) of 5 elements with zero sum and no two consecutive zero elements.

%I A199532 #9 May 15 2018 20:43:57
%S A199532 32,320,1324,3734,8470,16682,29750,49284,77124,115340,166232,232330,
%T A199532 316394,421414,550610,707432,895560,1118904,1381604,1688030,2042782,
%U A199532 2450690,2916814,3446444,4045100,4718532,5472720,6313874,7248434,8283070
%N A199532 Number of -n..n arrays x(0..4) of 5 elements with zero sum and no two consecutive zero elements.
%C A199532 Row 5 of A199530.
%H A199532 R. H. Hardin, <a href="/A199532/b199532.txt">Table of n, a(n) for n = 1..200</a>
%F A199532 Empirical: a(n) = (115/12)*n^4 + (115/6)*n^3 + (41/12)*n^2 - (1/6)*n.
%F A199532 Conjectures from _Colin Barker_, May 15 2018: (Start)
%F A199532 G.f.: 2*x*(16 + 80*x + 22*x^2 - 3*x^3) / (1 - x)^5.
%F A199532 a(n) = 5*a(n-1) - 10*a(n-2) + 10*a(n-3) - 5*a(n-4) + a(n-5) for n>5.
%F A199532 (End)
%e A199532 Some solutions for n=5:
%e A199532 ..2....1....3...-5....1....0....5....5...-3....4...-5....1...-5...-2....0...-1
%e A199532 .-5...-2....4....4....4...-1...-3....0...-1...-3....1....0....3....3....1....5
%e A199532 .-4...-2...-4....1....3....1...-3...-2....2...-5....2...-5...-2...-3...-3....3
%e A199532 ..3....4...-1...-2...-5....3...-1...-1...-3...-1....2....4...-1...-2...-3...-3
%e A199532 ..4...-1...-2....2...-3...-3....2...-2....5....5....0....0....5....4....5...-4
%Y A199532 Cf. A199530.
%K A199532 nonn
%O A199532 1,1
%A A199532 _R. H. Hardin_, Nov 07 2011