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!)
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

%I #4 Feb 17 2014 12:32:44

%S 1592,14456,132316,1191324,10449784,92535056,831852752,7439225960,

%T 65951303220,586352178784,5239570638572,46746052645176,

%U 415832332809312,3702279407957208,33018763426054992,294336790951580044

%N 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

%C Column 2 of A238081

%H R. H. Hardin, <a href="/A238075/b238075.txt">Table of n, a(n) for n = 1..210</a>

%F 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

%e Some solutions for n=3

%e ..2..0..3....0..2..1....1..1..3....2..1..0....1..3..0....0..2..1....0..3..3

%e ..0..2..1....0..1..2....2..2..3....2..2..0....1..2..0....0..1..2....2..2..1

%e ..3..3..2....1..3..1....1..0..2....1..3..3....1..2..2....3..2..0....0..1..2

%e ..1..1..0....2..2..0....3..1..0....0..1..3....0..1..1....1..3..3....0..0..0

%K nonn

%O 1,1

%A _R. H. Hardin_, Feb 17 2014

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 September 16 23:59 EDT 2024. Contains 375984 sequences. (Running on oeis4.)