|
|
A231032
|
|
Number of n X 3 0..2 arrays x(i,j) with each element horizontally, diagonally or antidiagonally next to at least one element with value (x(i,j)+1) mod 3 and at least one element with value (x(i,j)-1) mod 3, and upper left element zero.
|
|
1
|
|
|
0, 0, 10, 32, 278, 2988, 23058, 199272, 1722118, 14609220, 124974458, 1068235680, 9122055726, 77940647452, 665873921154, 5688536171256, 48598714312182, 415188274268468, 3547028395905802, 30302970815445712, 258884133806216126
(list;
graph;
refs;
listen;
history;
text;
internal format)
|
|
|
OFFSET
|
1,3
|
|
COMMENTS
|
|
|
LINKS
|
|
|
FORMULA
|
Empirical: a(n) = 9*a(n-1) -a(n-2) +15*a(n-3) -374*a(n-4) +260*a(n-5) +256*a(n-6) +60*a(n-7) -176*a(n-8) -32*a(n-9).
Empirical g.f.: 2*x^3*(5 - 29*x + 184*x^3 - 148*x^4 - 32*x^5) / (1 - 9*x + x^2 - 15*x^3 + 374*x^4 - 260*x^5 - 256*x^6 - 60*x^7 + 176*x^8 + 32*x^9). - Colin Barker, Feb 09 2018
|
|
EXAMPLE
|
Some solutions for n=3:
..0..1..0....0..1..0....0..1..0....0..1..0....0..2..0....0..1..0....0..2..0
..1..2..2....2..2..0....2..2..1....0..2..2....0..1..1....2..2..2....1..1..2
..1..0..1....1..0..1....1..0..1....1..0..1....2..0..2....1..0..1....2..0..2
|
|
CROSSREFS
|
|
|
KEYWORD
|
nonn
|
|
AUTHOR
|
|
|
STATUS
|
approved
|
|
|
|