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

 Hints (Greetings from The On-Line Encyclopedia of Integer Sequences!)
 A260837 Number of (n+2)X(4+2) 0..1 arrays with each 3X3 subblock having clockwise perimeter pattern 00000001 00000011 or 00010101 1

%I

%S 364,496,1224,2235,2590,6232,13170,17731,34192,77780,123488,206695,

%T 457440,825256,1336836,2725379,5298108,8851516,16674798,33192375,

%U 58277638,104857040,206110260,377809047,671142648,1283474236,2413960656

%N Number of (n+2)X(4+2) 0..1 arrays with each 3X3 subblock having clockwise perimeter pattern 00000001 00000011 or 00010101

%C Column 4 of A260841

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

%F Empirical: a(n) = a(n-1) +a(n-2) +6*a(n-3) -a(n-4) -12*a(n-5) -15*a(n-6) +2*a(n-7) +18*a(n-8) +28*a(n-9) -3*a(n-10) -28*a(n-11) -a(n-12) +9*a(n-13) +12*a(n-14) +10*a(n-15) -19*a(n-16) -36*a(n-17) +4*a(n-18) +10*a(n-19) -4*a(n-20) +23*a(n-21) +a(n-22) -20*a(n-23) +9*a(n-24) +10*a(n-25) -4*a(n-26) +6*a(n-27) +8*a(n-28) -14*a(n-29) +2*a(n-31) -5*a(n-32) +3*a(n-33) for n>34

%e Some solutions for n=4

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

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

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

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

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

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

%Y Cf. A260841

%K nonn

%O 1,1

%A _R. H. Hardin_, Aug 01 2015

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 22 11:40 EST 2022. Contains 350481 sequences. (Running on oeis4.)