The OEIS Foundation is supported by donations from users of the OEIS and by a grant from the Simons Foundation.

 Hints (Greetings from The On-Line Encyclopedia of Integer Sequences!)
 A238075 Number of (n+1)X(2+1) 0..3 arrays with the maximum plus the minimum of every 2X2 subblock differing from its horizontal and vertical neighbors by exactly one 1
 1592, 14456, 132316, 1191324, 10449784, 92535056, 831852752, 7439225960, 65951303220, 586352178784, 5239570638572, 46746052645176, 415832332809312, 3702279407957208, 33018763426054992, 294336790951580044 (list; graph; refs; listen; history; text; internal format)
 OFFSET 1,1 COMMENTS Column 2 of A238081 LINKS R. H. Hardin, Table of n, a(n) for n = 1..210 FORMULA Empirical: a(n) = 10*a(n-2) +165*a(n-3) +2783*a(n-4) +8976*a(n-5) +13643*a(n-6) +42570*a(n-7) +93986*a(n-8) +76838*a(n-9) +77637*a(n-10) +18072*a(n-11) -446505*a(n-12) -618063*a(n-13) +36527*a(n-14) +468207*a(n-15) +367938*a(n-16) +266880*a(n-17) +147620*a(n-18) +36465*a(n-19) +9662*a(n-20) +5338*a(n-21) +2364*a(n-22) +174*a(n-23) +20*a(n-24) +48*a(n-25) for n>26 EXAMPLE Some solutions for n=3 ..2..0..3....0..2..1....1..1..3....2..1..0....1..3..0....0..2..1....0..3..3 ..0..2..1....0..1..2....2..2..3....2..2..0....1..2..0....0..1..2....2..2..1 ..3..3..2....1..3..1....1..0..2....1..3..3....1..2..2....3..2..0....0..1..2 ..1..1..0....2..2..0....3..1..0....0..1..3....0..1..1....1..3..3....0..0..0 CROSSREFS Sequence in context: A049520 A252085 A224948 * A250959 A224943 A045273 Adjacent sequences:  A238072 A238073 A238074 * A238076 A238077 A238078 KEYWORD nonn AUTHOR R. H. Hardin, Feb 17 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.

Last modified April 5 18:26 EDT 2020. Contains 333246 sequences. (Running on oeis4.)