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 A229391 #6 Jul 23 2025 05:42:52 %S A229391 6528,4346752,1353901580,358453456908,93250181644300, %T A229391 24062262212427788,6184286713271025676,1586293889549249544204, %U A229391 406490146565253022875660,104112538108301161330114572,26659345510937391379492372492 %N A229391 Number of nX7 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)X8 0..1 array. %C A229391 Column 7 of A229392 %H A229391 R. H. Hardin, <a href="/A229391/b229391.txt">Table of n, a(n) for n = 1..99</a> %F A229391 Empirical: a(n) = 385*a(n-1) -33152*a(n-2) +33024*a(n-3) -98560*a(n-4) +8486912*a(n-5) -8388608*a(n-6) for n>9 %e A229391 Some solutions for n=2 %e A229391 ..0..0..1..2..0..1..2....0..0..0..1..1..2..3....0..0..1..1..2..2..1 %e A229391 ..1..1..2..2..1..0..1....1..1..1..3..3..3..2....1..1..1..2..2..3..3 %K A229391 nonn %O A229391 1,1 %A A229391 _R. H. Hardin_ Sep 21 2013