The OEIS Foundation is supported by donations from users of the OEIS and by a grant from the Simons Foundation.

Thanks to everyone who made a donation during our annual appeal!
To see the list of donors, or make a donation, see the OEIS Foundation home page.

 Hints (Greetings from The On-Line Encyclopedia of Integer Sequences!)
 A297377 Number of 4Xn 0..1 arrays with every 1 horizontally or antidiagonally adjacent to 0, 1 or 2 neighboring 1s. 1

%I

%S 16,256,2719,33054,409507,4986469,60872732,743909663,9087712969,

%T 111015076360,1356192930409,16567606520027,202393918892066,

%U 2472494255542067,30204603851425887,368986932888605430

%N Number of 4Xn 0..1 arrays with every 1 horizontally or antidiagonally adjacent to 0, 1 or 2 neighboring 1s.

%C Row 4 of A297374.

%H R. H. Hardin, <a href="/A297377/b297377.txt">Table of n, a(n) for n = 1..210</a>

%F Empirical: a(n) = 8*a(n-1) +22*a(n-2) +297*a(n-3) +568*a(n-4) +2486*a(n-5) +500*a(n-6) +2382*a(n-7) -19530*a(n-8) -3588*a(n-9) -20071*a(n-10) +74284*a(n-11) +27587*a(n-12) -124497*a(n-13) +26577*a(n-14) +93433*a(n-15) -61715*a(n-16) -42323*a(n-17) +61267*a(n-18) +1215*a(n-19) -40946*a(n-20) +11059*a(n-21) +18132*a(n-22) -7844*a(n-23) -5984*a(n-24) +3192*a(n-25) +1312*a(n-26) -708*a(n-27) -128*a(n-28) +64*a(n-29) for n>31

%e Some solutions for n=5

%e ..0..0..0..0..0. .0..1..0..0..1. .0..1..0..0..1. .0..1..1..0..1

%e ..0..0..1..0..0. .0..0..0..0..1. .0..0..0..0..1. .0..0..0..0..1

%e ..1..1..0..1..0. .0..1..1..0..1. .0..0..0..0..1. .0..1..0..1..0

%e ..0..0..0..1..0. .0..1..0..0..1. .1..1..0..1..1. .1..1..0..1..1

%Y Cf. A297374.

%K nonn

%O 1,1

%A _R. H. Hardin_, Dec 29 2017

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Style Sheet | Transforms | Superseeker | Recent
The OEIS Community | Maintained by The OEIS Foundation Inc.

Last modified January 18 16:27 EST 2020. Contains 331011 sequences. (Running on oeis4.)