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.

A297399 Number of 6Xn 0..1 arrays with every 1 horizontally, diagonally or antidiagonally adjacent to 1 neighboring 1.

Original entry on oeis.org

1, 85, 369, 1243, 15541, 99682, 514945, 3977868, 27131403, 165041224, 1128035711, 7625285858, 49170022362, 326850563103, 2183716617103, 14348810814654, 94917649585924, 630373096158959, 4164712261202289, 27543277723412233
Offset: 1

Views

Author

R. H. Hardin, Dec 29 2017

Keywords

Comments

Row 6 of A297395.

Examples

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

Crossrefs

Cf. A297395.

Formula

Empirical: a(n) = a(n-1) +6*a(n-2) +210*a(n-3) +229*a(n-4) +55*a(n-5) -9886*a(n-6) -14173*a(n-7) -8075*a(n-8) +195748*a(n-9) +181875*a(n-10) +87663*a(n-11) -1422344*a(n-12) -337739*a(n-13) -1114957*a(n-14) +5525820*a(n-15) -2908803*a(n-16) -871445*a(n-17) -12476178*a(n-18) +150124*a(n-19) +5056777*a(n-20) +2216204*a(n-21) -5969575*a(n-22) -10404139*a(n-23) +965484*a(n-24) +7909580*a(n-25) +142084*a(n-26) -4532588*a(n-27) -259328*a(n-28) +1045248*a(n-29) +23360*a(n-30) -64512*a(n-31)