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!)
A238293 Number of (n+1) X (1+1) 0..3 arrays with the maximum plus the upper median minus the lower median of every 2 X 2 subblock differing from its horizontal and vertical neighbors by exactly one. 1
256, 1836, 13405, 99036, 730412, 5365422, 39447709, 290457856, 2138629508, 15729683540, 115738375440, 851696818464, 6268744175264, 46119373785696, 339401856662548, 2497274479295728, 18379234719307992, 135224806527545920 (list; graph; refs; listen; history; text; internal format)
OFFSET
1,1
COMMENTS
Column 1 of A238298.
LINKS
FORMULA
Empirical: a(n) = 2164*a(n-4) +42300*a(n-6) +6272*a(n-8) -2398088*a(n-10) -2032176*a(n-12) +45261648*a(n-14) +13403744*a(n-16) -307030624*a(n-18) +71723392*a(n-20) +530758336*a(n-22) -23717632*a(n-24) +45493248*a(n-26) +5124096*a(n-28) -18071552*a(n-30) +458752*a(n-32) for n>33.
EXAMPLE
Some solutions for n=4
..2..3....0..1....0..1....1..0....2..0....1..2....3..3....2..0....1..1....1..2
..0..2....1..0....2..3....2..0....0..3....0..3....1..1....3..0....2..2....0..1
..0..2....2..0....1..2....3..3....0..1....1..3....3..2....2..1....0..2....1..1
..3..0....2..2....3..0....2..3....1..3....2..3....0..2....1..2....2..1....0..2
..1..2....3..2....3..1....3..2....2..3....2..1....3..1....1..1....1..0....1..2
CROSSREFS
Cf. A238298.
Sequence in context: A238145 A238140 A238298 * A237898 A237891 A237158
KEYWORD
nonn
AUTHOR
R. H. Hardin, Feb 23 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 July 14 13:47 EDT 2024. Contains 374318 sequences. (Running on oeis4.)