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!)
A236909 Number of (n+1)X(6+1) 0..3 arrays with the maximum plus the upper median plus the minimum of every 2X2 subblock equal 1
417488, 18527054, 789404948, 48719331954, 2754669234544, 181159580885672, 11117966288886496, 735514999641938272, 46476544201453674022, 3063085568629398114756, 196048500796508353058304 (list; graph; refs; listen; history; text; internal format)
OFFSET

1,1

COMMENTS

Column 6 of A236911

LINKS

R. H. Hardin, Table of n, a(n) for n = 1..41

EXAMPLE

Some solutions for n=1

..0..0..0..3..0..0..3....0..3..0..3..3..3..3....0..0..2..2..3..2..2

..3..3..3..3..3..3..3....3..2..3..3..0..0..3....3..2..3..0..0..2..1

CROSSREFS

Sequence in context: A234663 A183591 A184770 * A104920 A151838 A259404

Adjacent sequences:  A236906 A236907 A236908 * A236910 A236911 A236912

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.

License Agreements, Terms of Use, Privacy Policy. .

Last modified July 9 05:50 EDT 2020. Contains 335538 sequences. (Running on oeis4.)