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.

A229387 Number of n X 3 0..3 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 4 0..1 array.

This page as a plain text file.
%I A229387 #8 May 12 2014 13:17:10
%S A229387 48,1064,19124,319340,5212236,84210828,1353901580,21715025932,
%T A229387 347864379404,5569247981580,89135525871628,1426390613032972,
%U A229387 22824041387196428,365199107635675148,5843302195296469004
%N A229387 Number of n X 3 0..3 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 4 0..1 array.
%C A229387 Column 3 of A229392.
%H A229387 R. H. Hardin, <a href="/A229387/b229387.txt">Table of n, a(n) for n = 1..210</a>
%F A229387 Empirical: a(n) = 25*a(n-1) -152*a(n-2) +144*a(n-3) -368*a(n-4) +1888*a(n-5) -1536*a(n-6) for n>9.
%e A229387 Some solutions for n=3:
%e A229387 ..3..2..1....1..1..0....1..1..1....0..0..1....3..2..2....1..0..1....2..2..2
%e A229387 ..2..2..1....1..2..2....2..3..2....0..2..2....3..3..1....0..0..0....0..1..2
%e A229387 ..1..0..2....2..3..3....2..1..1....2..1..1....3..1..1....1..1..0....1..3..2
%K A229387 nonn
%O A229387 1,1
%A A229387 _R. H. Hardin_, Sep 21 2013