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.

A232071 Number of (n+1)X(3+1) 0..1 arrays with every element equal to some horizontal, diagonal or antidiagonal neighbor, with top left element zero.

Original entry on oeis.org

46, 520, 6624, 82996, 1043172, 13105012, 164650280, 2068621706, 25989674166, 326528021922, 4102419848778, 51541819920986, 647559075731254, 8135777066019200, 102215953652767856, 1284216749830662044
Offset: 1

Views

Author

R. H. Hardin, Nov 17 2013

Keywords

Comments

Column 3 of A232076

Examples

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

Formula

Empirical: a(n) = 10*a(n-1) +33*a(n-2) +6*a(n-3) -176*a(n-4) -300*a(n-5) -15*a(n-6) -76*a(n-7) +79*a(n-8) +72*a(n-9) -16*a(n-10)