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!)
A236081 Number of (n+1) X (5+1) 0..2 arrays with the sum of each 2 X 2 subblock maximum and minimum lexicographically nondecreasing rowwise and columnwise. 1

%I #6 Sep 25 2023 22:44:05

%S 167892,40097396,10003171144,2353737191047,558542932337300,

%T 126138961904040570,27744841719671138194,5832339695757183406469,

%U 1183186252204989571469409,230924323943367731755228208

%N Number of (n+1) X (5+1) 0..2 arrays with the sum of each 2 X 2 subblock maximum and minimum lexicographically nondecreasing rowwise and columnwise.

%C Column 5 of A236082.

%H R. H. Hardin, <a href="/A236081/b236081.txt">Table of n, a(n) for n = 1..18</a>

%e Some solutions for n=1

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

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

%Y Cf. A236082.

%K nonn

%O 1,1

%A _R. H. Hardin_, Jan 19 2014

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 June 24 19:44 EDT 2024. Contains 373690 sequences. (Running on oeis4.)