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.

A229387 Number of n X 3 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) X 4 0..1 array.

Original entry on oeis.org

48, 1064, 19124, 319340, 5212236, 84210828, 1353901580, 21715025932, 347864379404, 5569247981580, 89135525871628, 1426390613032972, 22824041387196428, 365199107635675148, 5843302195296469004
Offset: 1

Views

Author

R. H. Hardin, Sep 21 2013

Keywords

Comments

Column 3 of A229392.

Examples

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

Formula

Empirical: a(n) = 25*a(n-1) -152*a(n-2) +144*a(n-3) -368*a(n-4) +1888*a(n-5) -1536*a(n-6) for n>9.