login
The OEIS is supported by the many generous donors to the OEIS Foundation.

 

Logo
Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A297545 Number of 2 X n 0..1 arrays with every 1 horizontally, diagonally or antidiagonally adjacent to 2 or 3 neighboring 1s. 2

%I #7 Mar 22 2018 09:47:50

%S 1,2,11,24,38,105,381,1067,2676,7533,22732,65556,183281,521969,

%T 1510877,4344326,12399075,35475604,101864678,292266497,837202865,

%U 2398735503,6877922768,19720368509,56523514608,162009389860,464424317089

%N Number of 2 X n 0..1 arrays with every 1 horizontally, diagonally or antidiagonally adjacent to 2 or 3 neighboring 1s.

%C Row 2 of A297544.

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

%F Empirical: a(n) = 3*a(n-1) - 2*a(n-2) + 5*a(n-3) + 6*a(n-4) - 16*a(n-5) - 12*a(n-6).

%F Empirical g.f.: x*(1 - x + 7*x^2 - 10*x^3 - 28*x^4 - 12*x^5) / (1 - 3*x + 2*x^2 - 5*x^3 - 6*x^4 + 16*x^5 + 12*x^6). - _Colin Barker_, Mar 22 2018

%e Some solutions for n=5:

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

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

%Y Cf. A297544.

%K nonn

%O 1,2

%A _R. H. Hardin_, Dec 31 2017

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

License Agreements, Terms of Use, Privacy Policy. .

Last modified April 25 11:06 EDT 2024. Contains 371967 sequences. (Running on oeis4.)