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!)
A237673 Number of (n+1)X(2+1) 0..3 arrays with the maximum plus the upper median plus the minimum of every 2X2 subblock differing from its horizontal and vertical neighbors by exactly one 1
1564, 14244, 132572, 1346420, 13569422, 134401476, 1333046350, 13340078386, 133387449994, 1328426151742, 13234291152744, 132112050245452, 1318587054311498, 13147462329089532, 131102446354703274 (list; graph; refs; listen; history; text; internal format)
OFFSET
1,1
COMMENTS
Column 2 of A237677
LINKS
EXAMPLE
Some solutions for n=3
..1..1..3....2..3..0....0..2..3....2..1..2....2..3..3....2..1..1....2..1..3
..2..2..1....1..3..1....1..2..0....1..1..0....1..2..1....0..2..2....3..3..0
..0..2..2....0..3..2....0..1..2....2..0..3....3..3..2....3..1..3....0..1..2
..1..1..0....2..1..1....3..1..2....2..0..0....2..0..0....0..1..1....2..3..2
CROSSREFS
Sequence in context: A280354 A072394 A243528 * A246734 A237467 A035890
KEYWORD
nonn
AUTHOR
R. H. Hardin, Feb 11 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 May 9 14:31 EDT 2024. Contains 372351 sequences. (Running on oeis4.)