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.

A229390 Number of nX6 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)X7 0..1 array.

This page as a plain text file.
%I A229390 #6 Jul 23 2025 05:42:45
%S A229390 1912,546752,84210828,11156280332,1451228983308,187243393024012,
%T A229390 24062262212427788,3086056460257853452,395404788283905933324,
%U A229390 50636744827896225333260,6483098981333181772333068
%N A229390 Number of nX6 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)X7 0..1 array.
%C A229390 Column 6 of A229392
%H A229390 R. H. Hardin, <a href="/A229390/b229390.txt">Table of n, a(n) for n = 1..116</a>
%F A229390 Empirical: a(n) = 193*a(n-1) -8384*a(n-2) +8320*a(n-3) -24704*a(n-4) +1073152*a(n-5) -1048576*a(n-6) for n>9
%e A229390 Some solutions for n=2
%e A229390 ..1..1..1..1..1..2....1..1..1..2..2..2....1..0..1..2..1..3....1..1..1..1..2..3
%e A229390 ..0..2..3..1..0..2....0..1..1..1..1..1....0..1..1..1..2..3....1..1..0..1..3..3
%K A229390 nonn
%O A229390 1,1
%A A229390 _R. H. Hardin_ Sep 21 2013