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.

A221963 Number of -4..4 arrays of length n with the sum ahead of each element differing from the sum following that element by 4 or less.

This page as a plain text file.
%I A221963 #12 Aug 11 2018 13:06:45
%S A221963 9,81,369,2241,12609,73089,419841,2419713,13930497,80230401,462012417,
%T A221963 2660655105,15322038273,88236228609,508131934209,2926215692289,
%U A221963 16851403538433,97043367329793,558850475294721,3218291629752321
%N A221963 Number of -4..4 arrays of length n with the sum ahead of each element differing from the sum following that element by 4 or less.
%C A221963 Column 4 of A221967.
%H A221963 R. H. Hardin, <a href="/A221963/b221963.txt">Table of n, a(n) for n = 1..82</a>
%F A221963 Empirical: a(n) = 5*a(n-1) + 8*a(n-2) - 20*a(n-3) - 8*a(n-4) + 16*a(n-5).
%F A221963 Empirical g.f.: 9*x*(1 - 2*x)*(1 + 6*x - 8*x^3) / ((1 - x)*(1 + 2*x)*(1 - 6*x + 8*x^3)). - _Colin Barker_, Aug 11 2018
%e A221963 Some solutions for n=6:
%e A221963 .-3...-2....3....2....3...-4....1....1....2....0....0...-1...-3...-4...-2....0
%e A221963 ..4....1....3...-1...-3....1...-3....0...-2....1...-3....4....1...-2....4....3
%e A221963 .-3....1...-4...-2....2....4....2....3....0...-4...-2...-4....2....4...-2...-2
%e A221963 ..1...-3...-3....2....3...-4....1....0....1...-1....4....1....1...-1...-2...-1
%e A221963 .-2....3....4....1...-4....3...-1....0...-3....3...-2....2...-3....0....3....1
%e A221963 ..2...-3....2...-2....2...-3....2....1....2...-2...-1...-2....0...-3....1....0
%Y A221963 Cf. A221967.
%K A221963 nonn
%O A221963 1,1
%A A221963 _R. H. Hardin_, Feb 01 2013