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!)
A205189 Number of (n+1) X 5 0..1 arrays with the number of clockwise edge increases in every 2 X 2 subblock differing from each horizontal or vertical neighbor. 1

%I #8 Jun 11 2018 04:18:06

%S 72,104,160,256,384,576,864,1312,1984,3008,4544,6880,10400,15744,

%T 23808,36032,54496,82464,124736,188736,285504,431968,653472,988672,

%U 1495680,2262848,3423328,5179168,7835328,11854016,17933504,27131360,41046176

%N Number of (n+1) X 5 0..1 arrays with the number of clockwise edge increases in every 2 X 2 subblock differing from each horizontal or vertical neighbor.

%C Column 4 of A205193.

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

%F Empirical: a(n) = a(n-1) +a(n-2) -a(n-3) +a(n-4) for n>6.

%F Empirical g.f.: 8*x*(9 + 4*x - 2*x^2 + 8*x^3 - x^5) / (1 - x - x^2 + x^3 - x^4). - _Colin Barker_, Jun 11 2018

%e Some solutions for n=4:

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

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

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

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

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

%Y Cf. A205193.

%K nonn

%O 1,1

%A _R. H. Hardin_, Jan 23 2012

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 03:08 EDT 2024. Contains 371918 sequences. (Running on oeis4.)