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!)
A254238 Number of (n+2)X(4+2) 0..1 arrays with every 3X3 subblock diagonal sum plus antidiagonal minimum nondecreasing horizontally and vertically 1

%I #4 Jan 27 2015 08:14:51

%S 41140,167637,970333,5606832,21582041,80104299,277964612,863193207,

%T 2642194905,7927642723,23138956240,66674563382,190259311816,

%U 537311258526,1507557132590,4209998576739,11703042069925,32423030456075

%N Number of (n+2)X(4+2) 0..1 arrays with every 3X3 subblock diagonal sum plus antidiagonal minimum nondecreasing horizontally and vertically

%C Column 4 of A254242

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

%e Some solutions for n=2

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

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

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

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

%K nonn

%O 1,1

%A _R. H. Hardin_, Jan 27 2015

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 24 20:08 EDT 2024. Contains 371963 sequences. (Running on oeis4.)