login
The OEIS is supported by the many generous donors to the OEIS Foundation.

 

Logo
Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A199849 Number of -n..n arrays x(0..4) of 5 elements with zero sum and no element more than one greater than the previous. 1

%I #9 May 16 2018 16:34:59

%S 26,66,132,239,399,630,944,1367,1913,2612,3482,4557,5857,7424,9278,

%T 11465,14011,16966,20356,24239,28643,33630,39232,45515,52513,60300,

%U 68910,78421,88873,100348,112886,126577,141463,157638,175148,194091,214515,236526

%N Number of -n..n arrays x(0..4) of 5 elements with zero sum and no element more than one greater than the previous.

%C Row 5 of A199847.

%H R. H. Hardin, <a href="/A199849/b199849.txt">Table of n, a(n) for n = 1..200</a>

%F Empirical: a(n) = 2*a(n-1) -a(n-3) -2*a(n-5) +2*a(n-6) +a(n-8) -2*a(n-10) +a(n-11) for n>12.

%F Empirical g.f.: x*(26 + 14*x + x^3 - 13*x^4 + 16*x^5 + 3*x^6 + 10*x^7 - 3*x^8 - 16*x^9 + 7*x^10 + x^11) / ((1 - x)^5*(1 + x)^2*(1 + x^2)*(1 + x + x^2)). - _Colin Barker_, May 16 2018

%e Some solutions for n=6:

%e ..2....2....5....2....6....6....6....4....3....4....4....3....2....3....6....1

%e ..3....3....6....1....2....4....6....3....1....1....3....2....0....4....2....2

%e ..2....0...-3....1....3...-2...-1...-1....0...-2....0....2....1....4...-3....2

%e .-3...-2...-3....1...-6...-3...-5....0...-2...-1...-2...-3....0...-5...-2...-2

%e .-4...-3...-5...-5...-5...-5...-6...-6...-2...-2...-5...-4...-3...-6...-3...-3

%Y Cf. A199847.

%K nonn

%O 1,1

%A _R. H. Hardin_, Nov 11 2011

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Style Sheet | Transforms | Superseeker | Recents
The OEIS Community | Maintained by The OEIS Foundation Inc.

License Agreements, Terms of Use, Privacy Policy. .

Last modified April 24 17:51 EDT 2024. Contains 371962 sequences. (Running on oeis4.)