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.

A269275 Number of nX7 0..3 arrays with some element plus some horizontally or antidiagonally adjacent neighbor totalling three exactly once.

Original entry on oeis.org

5832, 9211608, 9230973192, 7934992835112, 6310088238337128, 4786284820998999528, 3516906597130333936872, 2525822328725627338344168, 1783069155917082001205203176, 1241926797984458949166277812968
Offset: 1

Views

Author

R. H. Hardin, Feb 21 2016

Keywords

Comments

Column 7 of A269276.

Examples

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

Crossrefs

Cf. A269276.

Formula

Empirical: a(n) = 1384*a(n-1) -566002*a(n-2) +61993580*a(n-3) -3083170217*a(n-4) +82564587476*a(n-5) -1288497445564*a(n-6) +12048887832352*a(n-7) -66380108132464*a(n-8) +198314583195456*a(n-9) -247475435747904*a(n-10) for n>11