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.
%I A221965 #8 Aug 14 2018 08:57:14 %S A221965 13,169,1105,9633,78273,653185,5407233,44890625,372332545,3089205249, %T A221965 25628045313,212618141697,1763923329025,14633929146369, %U A221965 121406394466305,1007215475032065,8356090693812225,69324049716609025,575128245018558465 %N A221965 Number of -6..6 arrays of length n with the sum ahead of each element differing from the sum following that element by 6 or less. %C A221965 Column 6 of A221967. %H A221965 R. H. Hardin, <a href="/A221965/b221965.txt">Table of n, a(n) for n = 1..90</a> %F A221965 Empirical: a(n) = 7*a(n-1) + 18*a(n-2) - 56*a(n-3) - 48*a(n-4) + 112*a(n-5) + 32*a(n-6) - 64*a(n-7). %F A221965 Empirical g.f.: 13*x*(1 + 6*x - 24*x^2 - 32*x^3 + 80*x^4 + 32*x^5 - 64*x^6) / ((1 - x)*(1 - 6*x - 24*x^2 + 32*x^3 + 80*x^4 - 32*x^5 - 64*x^6)). - _Colin Barker_, Aug 14 2018 %e A221965 Some solutions for n=6: %e A221965 .-3...-6....0...-6....3....0....0....0....0....0....0...-3...-6....3...-6...-6 %e A221965 ..3....5...-5...-3....0....3....0...-3...-3...-3...-2....0....1...-3....5....3 %e A221965 .-2...-1....1....5...-3...-3...-1....0....2....3...-3....0...-3....1....0...-3 %e A221965 ..3...-3....6...-1....2...-4....4...-4....3....0....6....0....6...-5...-2....4 %e A221965 .-5....3...-3...-1...-4....6...-5....4...-1....2...-5...-1...-2....4....1...-2 %e A221965 ..0...-2...-3...-3....5...-1....3...-3....0...-1...-2...-5...-6...-1....1...-3 %Y A221965 Cf. A221967. %K A221965 nonn %O A221965 1,1 %A A221965 _R. H. Hardin_, Feb 01 2013