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.

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.

Original entry on oeis.org

6528, 4346752, 1353901580, 358453456908, 93250181644300, 24062262212427788, 6184286713271025676, 1586293889549249544204, 406490146565253022875660, 104112538108301161330114572, 26659345510937391379492372492
Offset: 1

Views

Author

R. H. Hardin Sep 21 2013

Keywords

Comments

Column 7 of A229392

Examples

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

Formula

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