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!)
A236992 Number of (n+1) X (3+1) 0..2 arrays with the maximum plus the lower median minus the upper median minus the minimum of every 2 X 2 subblock differing from its horizontal and vertical neighbors by exactly one. 1
1600, 15552, 149632, 1513728, 14963200, 145732608, 1406076928, 14212288512, 140607692800, 1372136620032, 13275293581312, 134071759208448, 1327529358131200, 12979877140758528, 125916155331739648 (list; graph; refs; listen; history; text; internal format)
OFFSET
1,1
LINKS
FORMULA
Empirical: a(n) = 10*a(n-1) + 8704*a(n-4) - 87040*a(n-5).
Empirical g.f.: 64*x*(25 - 7*x - 92*x^2 + 272*x^3 - 220320*x^4) / ((1 - 10*x)*(1 - 8704*x^4)). - Colin Barker, Oct 21 2018
EXAMPLE
Some solutions for n=3:
..1..0..2..2....0..1..1..0....0..1..0..2....0..0..0..0....1..0..0..2
..1..1..1..0....1..2..1..2....0..1..1..1....1..2..2..1....0..1..0..0
..0..0..1..2....1..1..2..2....2..2..2..1....2..1..0..1....2..0..1..0
..2..1..0..2....0..0..2..2....0..2..1..2....1..1..2..0....1..1..1..2
CROSSREFS
Column 3 of A236997.
Sequence in context: A043412 A202096 A258675 * A251969 A206250 A187241
KEYWORD
nonn
AUTHOR
R. H. Hardin, Feb 02 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 March 28 05:02 EDT 2024. Contains 371235 sequences. (Running on oeis4.)