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.

A229432 Number of n X 2 0..6 arrays of the sum of the corresponding element, the element to the east and the element to the south in a larger (n+1) X 3 0..2 array.

This page as a plain text file.
%I A229432 #9 Sep 15 2018 09:25:15
%S A229432 43,1213,31111,775213,19122559,469959685,11533872679,282921116029,
%T A229432 6938596265551,170155677219253,4172626399905079,102321795525685549,
%U A229432 2509141498799895007,61529237938446659557,1508820887930727002695
%N A229432 Number of n X 2 0..6 arrays of the sum of the corresponding element, the element to the east and the element to the south in a larger (n+1) X 3 0..2 array.
%H A229432 R. H. Hardin, <a href="/A229432/b229432.txt">Table of n, a(n) for n = 1..210</a>
%F A229432 Empirical: a(n) = 37*a(n-1) - 342*a(n-2) + 936*a(n-3) - 1296*a(n-4).
%F A229432 Empirical g.f.: x*(1 - 6*x)*(43 - 120*x + 216*x^2) / (1 - 37*x + 342*x^2 - 936*x^3 + 1296*x^4). - _Colin Barker_, Sep 15 2018
%e A229432 Some solutions for n=2:
%e A229432 ..6..6....3..2....4..0....6..5....6..3....3..5....2..0....5..3....3..1....4..3
%e A229432 ..5..6....1..5....3..1....4..3....5..2....5..6....3..2....1..4....0..1....5..5
%Y A229432 Column 2 of A229437.
%K A229432 nonn
%O A229432 1,1
%A A229432 _R. H. Hardin_, Sep 23 2013