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!)
A268996 Number of 2 X n binary arrays with some element plus some horizontally or antidiagonally adjacent neighbor totalling two not more than once. 1

%I #7 Jan 18 2019 06:33:02

%S 4,13,35,103,278,763,2037,5421,14264,37321,97015,250963,646250,

%T 1657719,4237481,10798553,27442092,69563653,175938699,444060607,

%U 1118668286,2813233523,7063416349,17708464645,44335423456,110857865665,276863340767

%N Number of 2 X n binary arrays with some element plus some horizontally or antidiagonally adjacent neighbor totalling two not more than once.

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

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

%F Empirical g.f.: x*(4 + 5*x - 11*x^2 - 16*x^3 - 7*x^4 - x^5) / ((1 + x)^2*(1 - 2*x - x^2)^2). - _Colin Barker_, Jan 18 2019

%e Some solutions for n=4:

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

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

%Y Row 2 of A268995.

%K nonn

%O 1,1

%A _R. H. Hardin_, Feb 17 2016

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 24 22:17 EDT 2024. Contains 371964 sequences. (Running on oeis4.)