login
This site is supported by donations to The OEIS Foundation.

 

Logo


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

%I

%S 423416,781884,947990,5776350,49914501,422397021,3619976949,

%T 29207652750,244861394112,2092217128425,16878946536999,

%U 141511903099893,1209045836543067,9754550819148096,81783949750600599,698680981390316121

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

%C Column 3 of A204417

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

%F Empirical: a(n) = 577*a(n-3) +63*a(n-5) -63*a(n-8) for n>16

%e Some solutions for n=3

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

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

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

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

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

%K nonn

%O 1,1

%A _R. H. Hardin_ Jan 15 2012

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.

License Agreements, Terms of Use, Privacy Policy. .

Last modified September 19 04:39 EDT 2019. Contains 327187 sequences. (Running on oeis4.)