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.

A266097 Number of nX4 integer arrays with each element equal to the number of horizontal and antidiagonal neighbors exactly one smaller than itself.

Original entry on oeis.org

5, 36, 161, 929, 4893, 26948, 145274, 790986, 4286644, 23281595, 126318252, 685685972, 3721248548, 20197452145, 109618496442, 594950280201, 3229037349370, 17525382955525, 95117628995827, 516243924279843
Offset: 1

Views

Author

R. H. Hardin, Dec 21 2015

Keywords

Comments

Column 4 of A266101.

Examples

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

Crossrefs

Cf. A266101.

Formula

Empirical: a(n) = a(n-1) +24*a(n-2) +17*a(n-3) -89*a(n-4) -40*a(n-5) +146*a(n-6) +18*a(n-7) -82*a(n-8) -6*a(n-9) -8*a(n-10) +36*a(n-11) -13*a(n-12) +a(n-13) -2*a(n-14) +a(n-15) for n>16