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

 Hints (Greetings from The On-Line Encyclopedia of Integer Sequences!)
 A204602 Number of (n+2)X5 0..2 arrays with every 3X3 subblock having three strictly increasing elements in a row horizontally, vertically or nw-to-se diagonally exactly one way 1

%I #5 Mar 31 2012 12:37:02

%S 328845,741296,981914,5260434,43980907,327968423,2572437376,

%T 19830769591,145914949262,1140444970482,8787545915342,64670009972489,

%U 505434059501614,3894123049686996,28662130896313045,224003467472538457

%N Number of (n+2)X5 0..2 arrays with every 3X3 subblock having three strictly increasing elements in a row horizontally, vertically or nw-to-se diagonally exactly one way

%C Column 3 of A204607

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

%F Empirical: a(n) = 442*a(n-3) +63*a(n-5) +43*a(n-6) -63*a(n-8) +81*a(n-9) -81*a(n-12) for n>20

%e Some solutions for n=3

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

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

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

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

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

%K nonn

%O 1,1

%A _R. H. Hardin_ Jan 17 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.

Last modified December 1 03:32 EST 2023. Contains 367468 sequences. (Running on oeis4.)