|
|
A253312
|
|
Number of (n+1)X(6+1) 0..2 arrays with every 2X2 subblock diagonal maximum minus antidiagonal maximum unequal to its neighbors horizontally, vertically, diagonally and antidiagonally
|
|
1
|
|
|
1051870, 1053094, 8858020, 6728458, 53883500, 45899840, 352580820, 411726542, 2447644466, 4549989670, 21236471054, 58678596194, 237413653504, 831549840050, 3188655033276, 12424082609832, 47046111414124, 191305947190332
(list;
graph;
refs;
listen;
history;
text;
internal format)
|
|
|
OFFSET
|
1,1
|
|
COMMENTS
|
|
|
LINKS
|
|
|
FORMULA
|
Empirical: a(n) = 54*a(n-2) -1146*a(n-4) +11906*a(n-6) -57856*a(n-8) +41746*a(n-10) +915500*a(n-12) -5390084*a(n-14) +17243019*a(n-16) -23781910*a(n-18) -46626062*a(n-20) +220685238*a(n-22) -966711598*a(n-24) +5598015330*a(n-26) -16564562748*a(n-28) +32437880460*a(n-30) -82319238900*a(n-32) +196803047412*a(n-34) -299792408688*a(n-36) +416972982600*a(n-38) -699879086064*a(n-40) +808469304768*a(n-42) -550998028800*a(n-44) +537665236992*a(n-46) -589908013056*a(n-48) +235092492288*a(n-50) for n>64
|
|
EXAMPLE
|
Some solutions for n=1
..0..1..0..1..2..1..0....0..0..0..1..1..2..1....0..0..0..2..0..0..2
..1..2..2..0..1..2..1....2..1..1..2..2..0..0....2..1..1..1..1..0..2
|
|
CROSSREFS
|
|
|
KEYWORD
|
nonn
|
|
AUTHOR
|
|
|
STATUS
|
approved
|
|
|
|