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.

Original entry on oeis.org

164, 8592, 319340, 10624396, 345788172, 11156280332, 358453456908, 11493734735884, 368171037655052, 11787417479938060, 377292467256164364, 12074880676656054284, 386420529239766859788, 12365846497044862074892
Offset: 1

Views

Author

R. H. Hardin Sep 21 2013

Keywords

Comments

Column 4 of A229392

Examples

			Some solutions for n=2
..3..1..2..2....1..0..1..0....3..3..3..2....2..0..1..1....1..1..3..3
..2..2..3..1....1..2..1..0....3..2..3..3....1..0..1..2....0..2..2..2
		

Formula

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