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

Year-end appeal: Please make a donation to the OEIS Foundation to support ongoing development and maintenance of the OEIS. We are now in our 56th year, we are closing in on 350,000 sequences, and we’ve crossed 9,700 citations (which often say “discovered thanks to the OEIS”).

 Hints (Greetings from The On-Line Encyclopedia of Integer Sequences!)
 A254489 Number of (n+2)X(6+2) 0..1 arrays with every 3X3 subblock diagonal maximum plus antidiagonal minimum nondecreasing horizontally, vertically and ne-to-sw antidiagonally 1
 3727552, 186999040, 8552031360, 410218207872, 18812857512320, 871411470160000, 39860323285338752, 1827469551074952320, 83709155693842678400, 3847122344420401165440, 176332171765012162587264 (list; graph; refs; listen; history; text; internal format)
 OFFSET 1,1 COMMENTS Column 6 of A254491 LINKS R. H. Hardin, Table of n, a(n) for n = 1..198 EXAMPLE Some solutions for n=1 ..0..0..0..0..0..1..0..1....0..0..0..0..0..0..1..0....0..0..0..0..0..1..1..1 ..1..0..0..1..1..1..1..0....1..1..0..0..1..0..1..0....0..1..1..1..0..1..1..0 ..0..1..0..0..1..0..1..0....1..1..1..1..1..0..1..1....1..0..1..0..0..1..1..1 CROSSREFS Sequence in context: A187644 A136287 A254496 * A253861 A114683 A184647 Adjacent sequences:  A254486 A254487 A254488 * A254490 A254491 A254492 KEYWORD nonn AUTHOR R. H. Hardin, Jan 31 2015 STATUS approved

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.

Last modified December 6 11:48 EST 2021. Contains 349563 sequences. (Running on oeis4.)