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.

A268625 Number of n X 5 0..2 arrays with some element plus some horizontally or vertically adjacent neighbor totaling two no more than once.

Original entry on oeis.org

144, 2430, 34890, 467190, 6000978, 74914554, 915847266, 11018667294, 130903914954, 1539375100362, 17950677440298, 207850445630478, 2392281464029314, 27392205838123482, 312238767991217778
Offset: 1

Views

Author

R. H. Hardin, Feb 09 2016

Keywords

Comments

Column 5 of A268628.

Examples

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

Crossrefs

Cf. A268628.

Formula

Empirical: a(n) = 32*a(n-1) -386*a(n-2) +2264*a(n-3) -7265*a(n-4) +13512*a(n-5) -14960*a(n-6) +9872*a(n-7) -3776*a(n-8) +768*a(n-9) -64*a(n-10).