login
The OEIS Foundation is supported by donations from users of the OEIS and by a grant from the Simons Foundation.

 

Logo


Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A254240 Number of (n+2)X(6+2) 0..1 arrays with every 3X3 subblock diagonal sum plus antidiagonal minimum nondecreasing horizontally and vertically 1

%I

%S 514920,2228050,13376848,80104299,249684274,940766774,3047978749,

%T 8696762202,26336306288,78716251434,225295831770,651870318928,

%U 1860285741290,5237337951769,14747905907768,41414839936846

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

%C Column 6 of A254242

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

%e Some solutions for n=1

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

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

%e ..0..1..0..0..0..1..0..1....0..0..0..1..1..1..0..0....0..0..0..1..1..1..0..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 | Recent
The OEIS Community | Maintained by The OEIS Foundation Inc.

License Agreements, Terms of Use, Privacy Policy. .

Last modified February 19 16:24 EST 2020. Contains 332045 sequences. (Running on oeis4.)