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.

A302012 Number of 5Xn 0..1 arrays with every element equal to 0, 1, 2 or 3 horizontally or antidiagonally adjacent elements, with upper left element zero.

Original entry on oeis.org

16, 512, 13616, 368144, 9989376, 270990144, 7350348800, 199375282176, 5407964088576, 146688598302720, 3978862338503680, 107924853732951040, 2927413180587028480, 79404767608300756992, 2153818654894959054848
Offset: 1

Views

Author

R. H. Hardin, Mar 30 2018

Keywords

Comments

Row 5 of A302010.

Examples

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

Crossrefs

Cf. A302010.

Formula

Empirical: a(n) = 24*a(n-1) +100*a(n-2) -348*a(n-3) -1856*a(n-4) +1536*a(n-5) +14848*a(n-6) +2048*a(n-7) -65024*a(n-8) -40960*a(n-9) +139264*a(n-10) +102400*a(n-11) -147456*a(n-12) for n>15