A269094 Number of nX5 0..3 arrays with some element plus some horizontally or vertically adjacent neighbor totalling three exactly once.

432, 103488, 15024096, 1856325000, 211625837280, 22984646281176, 2416707037884480, 248267055360211392, 25062609875880382656, 2495854741014485439624, 245851383088389214772304

Offset: 1

Author

R. H. Hardin, Feb 19 2016

Keywords

• nonn

Comments

Column 5 of A269097.

Examples

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

Links

• R. H. Hardin, Table of n, a(n) for n = 1..210

Crossrefs

Cf. A269097.

Formula

Empirical: a(n) = 236*a(n-1) -19546*a(n-2) +707906*a(n-3) -13261621*a(n-4) [phone]*a(n-5) -784626841*a(n-6) [phone]*a(n-7) [phone]*a(n-8) -18874661724*a(n-9) [phone]*a(n-10) [phone]*a(n-11) -91783964484*a(n-12) [phone]*a(n-13) -30762353664*a(n-14) for n>15