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.

A208255 Number of nX5 0..2 arrays with new values 0..2 introduced in row major order and no element equal to more than one of its immediate leftward or upward neighbors.

Original entry on oeis.org

41, 6144, 920928, 137947632, 20662697664, 3094987890864, 463586569433280, 69438884409258336, 10400988693344761104, 1557924881981189122032, 233355694295516814615312, 34953469637696859885114528
Offset: 1

Views

Author

R. H. Hardin Feb 24 2012

Keywords

Comments

Column 5 of A208258

Examples

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

Formula

Empirical: a(n) = 171*a(n-1) -3370*a(n-2) +29805*a(n-3) -149108*a(n-4) +447784*a(n-5) -778496*a(n-6) +649216*a(n-7) -114688*a(n-8) for n>9