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!)
A236905 Number of (n+1)X(2+1) 0..3 arrays with the maximum plus the upper median plus the minimum of every 2X2 subblock equal 1
1056, 6762, 44836, 326868, 2411550, 18527054, 143619570, 1138035570, 9082354564, 73458657386, 597388648952, 4899765429646, 40348694602260, 334106991780094, 2774430383216444, 23121941059834148, 193077412267829618 (list; graph; refs; listen; history; text; internal format)
OFFSET
1,1
COMMENTS
Column 2 of A236911
LINKS
EXAMPLE
Some solutions for n=3
..1..2..3....0..3..0....1..1..3....0..2..3....3..3..0....2..2..2....3..0..3
..2..1..0....3..0..3....3..2..1....3..3..0....3..0..3....3..0..3....0..3..3
..2..2..3....0..3..0....0..3..2....0..3..3....3..0..3....2..1..2....3..3..0
..3..0..1....0..3..0....2..3..0....1..3..0....2..3..3....2..1..2....0..0..3
CROSSREFS
Sequence in context: A359624 A225714 A158692 * A281079 A023072 A168627
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 | Recents
The OEIS Community | Maintained by The OEIS Foundation Inc.

License Agreements, Terms of Use, Privacy Policy. .

Last modified April 24 18:17 EDT 2024. Contains 371962 sequences. (Running on oeis4.)