cp's OEIS Frontend

This is a front-end for the Online Encyclopedia of Integer Sequences, made by Christian Perfect. The idea is to provide OEIS entries in non-ancient HTML, and then to think about how they're presented visually. The source code is on GitHub.

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

This page as a plain text file.
%I A199848 #9 May 17 2018 17:02:06
%S A199848 11,23,42,68,103,149,206,276,361,461,578,714,869,1045,1244,1466,1713,
%T A199848 1987,2288,2618,2979,3371,3796,4256,4751,5283,5854,6464,7115,7809,
%U A199848 8546,9328,10157,11033,11958,12934,13961,15041,16176,17366,18613,19919,21284
%N A199848 Number of -n..n arrays x(0..3) of 4 elements with zero sum and no element more than one greater than the previous.
%C A199848 Row 4 of A199847.
%H A199848 R. H. Hardin, <a href="/A199848/b199848.txt">Table of n, a(n) for n = 1..200</a>
%F A199848 Empirical: a(n) = 3*a(n-1) -3*a(n-2) +2*a(n-3) -3*a(n-4) +3*a(n-5) -a(n-6).
%F A199848 Empirical g.f.: x*(11 - 10*x + 6*x^2 - 11*x^3 + 12*x^4 - 4*x^5) / ((1 - x)^4*(1 + x + x^2)). - _Colin Barker_, May 16 2018
%e A199848 Some solutions for n=6:
%e A199848 ..3....2....4....5....4....1....6....6....5....6....3....1....5....2....3....3
%e A199848 ..1....1....2...-1....5....2....2....3...-1....1....1....2....1....1....2....3
%e A199848 .-2....2...-1...-2...-5....2...-2...-3...-1...-1....1....1...-3....1...-2...-3
%e A199848 .-2...-5...-5...-2...-4...-5...-6...-6...-3...-6...-5...-4...-3...-4...-3...-3
%Y A199848 Cf. A199847.
%K A199848 nonn
%O A199848 1,1
%A A199848 _R. H. Hardin_, Nov 11 2011