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.

A302007 Number of nX5 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, 369040, 9989376, 270422672, 7320574992, 198174358400, 5364752820144, 145228540660944, 3931463336250816, 106428143490485072, 2881102723859806480, 77993965065966629248, 2111364699472345059888
Offset: 1

Views

Author

R. H. Hardin, Mar 30 2018

Keywords

Comments

Column 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..1..0. .0..0..1..0..0. .0..0..1..1..0
..1..1..1..0..1. .1..0..1..0..1. .0..1..1..0..1. .0..1..0..1..1
..0..1..0..0..1. .1..0..1..1..1. .1..1..1..0..0. .1..1..0..0..0
..0..0..0..0..1. .0..1..0..0..0. .0..1..0..0..0. .0..1..0..1..0
		

Crossrefs

Cf. A302010.

Formula

Empirical: a(n) = 24*a(n-1) +82*a(n-2) +34*a(n-3) -90*a(n-4) -40*a(n-5) +37*a(n-6)