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!)
A183718 1/20 of the number of (n+1) X 9 0..4 arrays with every 2 X 2 subblock strictly increasing clockwise or counterclockwise with one decrease. 1

%I #7 Oct 06 2015 22:00:08

%S 985,18566,303170,5374440,94463507,1680902120,29887741084,

%T 532844962952,9498797049301,169444214222538,3022597001362206,

%U 53927539247910656,962146234750661827,17166919088214504572,306297928172424966016

%N 1/20 of the number of (n+1) X 9 0..4 arrays with every 2 X 2 subblock strictly increasing clockwise or counterclockwise with one decrease.

%C Column 8 of A183719.

%H R. H. Hardin, <a href="/A183718/b183718.txt">Table of n, a(n) for n = 1..156</a>

%e Some solutions for 3 X 9:

%e ..0..2..0..1..0..2..0..2..1....0..3..0..4..0..3..4..3..0

%e ..4..3..4..2..4..3..4..3..0....1..2..1..2..1..2..1..2..1

%e ..1..2..0..1..0..2..0..2..1....0..3..4..3..0..3..0..3..4

%e ...

%e ...R..L..R..L..R..L..R..L.......L..R..L..R..L..R..L..R...

%e ...L..R..L..R..L..R..L..R.......R..L..R..L..R..L..R..L...

%K nonn

%O 1,1

%A _R. H. Hardin_, Jan 06 2011

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 19 02:45 EDT 2024. Contains 371782 sequences. (Running on oeis4.)