|
|
A237232
|
|
Number of (n+1) X (6+1) 0..2 arrays with the maximum plus the minimum of every 2 X 2 subblock differing from its horizontal and vertical neighbors by exactly one.
|
|
1
|
|
|
28912, 120540, 269844, 671080, 1737372, 5016852, 13078228, 34663620, 93075252, 252437984, 674728104, 1815877108, 4898412064, 13182357508, 35265033144, 95378791936, 256131894912, 690260009684, 1852770334916, 5004415058468
(list;
graph;
refs;
listen;
history;
text;
internal format)
|
|
|
OFFSET
|
1,1
|
|
COMMENTS
|
|
|
LINKS
|
|
|
FORMULA
|
Empirical: a(n) = 4*a(n-2) +24*a(n-4) +3*a(n-5) +4*a(n-6) +123*a(n-7) -513*a(n-9) +393*a(n-10) -1940*a(n-11) -6553*a(n-12) -2329*a(n-13) -21264*a(n-14) -12956*a(n-15) +6136*a(n-16) -13278*a(n-17) -21758*a(n-18) +155426*a(n-19) -77448*a(n-20) +448608*a(n-21) +574916*a(n-22) +20728*a(n-23) +1436288*a(n-24) +23184*a(n-25) +245120*a(n-26) +187872*a(n-27) +671424*a(n-28) +16128*a(n-29) +424000*a(n-30) -66048*a(n-31) +82944*a(n-32) +101376*a(n-34) for n>40.
|
|
EXAMPLE
|
Some solutions for n=2
..0..2..1..0..1..2..1....1..0..2..1..0..0..2....2..1..0..1..2..1..1
..0..1..2..1..0..1..2....0..1..2..2..1..1..0....0..0..1..2..1..0..0
..0..0..1..2..0..1..0....0..2..2..2..2..0..0....1..1..2..1..0..0..2
|
|
CROSSREFS
|
|
|
KEYWORD
|
nonn
|
|
AUTHOR
|
|
|
STATUS
|
approved
|
|
|
|