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!)
A235663 Number of (n+1)X(3+1) 0..3 arrays with the difference between each 2X2 subblock maximum and minimum lexicographically nondecreasing columnwise and nonincreasing rowwise 1
33610, 3405756, 314516602, 25779181084, 1970890033598, 141161012840294, 9652126935575732, 634521352294571412, 40476229916204622416, 2519324127973915344880, 153818507566307018434672 (list; graph; refs; listen; history; text; internal format)
OFFSET

1,1

COMMENTS

Column 3 of A235665

LINKS

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

EXAMPLE

Some solutions for n=1

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

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

CROSSREFS

Sequence in context: A142587 A116496 A235667 * A235428 A178280 A235745

Adjacent sequences:  A235660 A235661 A235662 * A235664 A235665 A235666

KEYWORD

nonn

AUTHOR

R. H. Hardin, Jan 13 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 April 5 16:53 EDT 2020. Contains 333245 sequences. (Running on oeis4.)