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

 Hints (Greetings from The On-Line Encyclopedia of Integer Sequences!)
 A236908 Number of (n+1)X(5+1) 0..3 arrays with the maximum plus the upper median plus the minimum of every 2X2 subblock equal 1
 89888, 2411550, 62508118, 2199548878, 72805879098, 2754669234544, 99111645582536, 3815804319538310, 141806974110918684, 5472746163209520482, 206303900273865851372, 7951608169013644936444, 301847053990799619905816 (list; graph; refs; listen; history; text; internal format)
 OFFSET 1,1 COMMENTS Column 5 of A236911 LINKS R. H. Hardin, Table of n, a(n) for n = 1..132 EXAMPLE Some solutions for n=1 ..1..2..2..2..2..2....3..3..0..3..3..0....2..1..1..2..0..3....1..1..2..3..3..1 ..2..0..0..0..0..1....0..1..3..0..2..3....1..3..2..3..3..0....3..2..3..0..2..2 CROSSREFS Sequence in context: A205898 A250452 A204670 * A331354 A270754 A252915 Adjacent sequences:  A236905 A236906 A236907 * A236909 A236910 A236911 KEYWORD nonn AUTHOR R. H. Hardin, Feb 01 2014 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 May 8 02:26 EDT 2021. Contains 343652 sequences. (Running on oeis4.)