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.

A229388 Number of nX4 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)X5 0..1 array.

This page as a plain text file.
%I A229388 #6 Jul 23 2025 05:42:23
%S A229388 164,8592,319340,10624396,345788172,11156280332,358453456908,
%T A229388 11493734735884,368171037655052,11787417479938060,377292467256164364,
%U A229388 12074880676656054284,386420529239766859788,12365846497044862074892
%N A229388 Number of nX4 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)X5 0..1 array.
%C A229388 Column 4 of A229392
%H A229388 R. H. Hardin, <a href="/A229388/b229388.txt">Table of n, a(n) for n = 1..174</a>
%F A229388 Empirical: a(n) = 49*a(n-1) -560*a(n-2) +544*a(n-3) -1568*a(n-4) +17920*a(n-5) -16384*a(n-6) for n>9
%e A229388 Some solutions for n=2
%e A229388 ..3..1..2..2....1..0..1..0....3..3..3..2....2..0..1..1....1..1..3..3
%e A229388 ..2..2..3..1....1..2..1..0....3..2..3..3....1..0..1..2....0..2..2..2
%K A229388 nonn
%O A229388 1,1
%A A229388 _R. H. Hardin_ Sep 21 2013