|
|
A217881
|
|
Number of n element 0..2 arrays with each element the minimum of 6 adjacent elements of a random 0..2 array of n+5 elements.
|
|
1
|
|
|
3, 9, 22, 46, 86, 148, 239, 372, 576, 915, 1520, 2639, 4711, 8471, 15107, 26516, 45758, 77899, 131586, 221935, 375670, 640002, 1097628, 1891754, 3267763, 5643077, 9725666, 16717471, 28666522, 49078549, 83978278, 143744065, 246264367
(list;
graph;
refs;
listen;
history;
text;
internal format)
|
|
|
OFFSET
|
1,1
|
|
COMMENTS
|
|
|
LINKS
|
|
|
FORMULA
|
Empirical: a(n) = 3*a(n-1) - 3*a(n-2) + a(n-3) + 3*a(n-7) - a(n-8) + a(n-9) + a(n-10) + a(n-11) + a(n-12) + a(n-13).
Empirical g.f.: x*(1 + x^2)*(1 + x^3 + x^4)*(3 + x^2 + x^3 + x^4 + x^5 + x^6) / (1 - 3*x + 3*x^2 - x^3 - 3*x^7 + x^8 - x^9 - x^10 - x^11 - x^12 - x^13). - Colin Barker, Jul 23 2018
|
|
EXAMPLE
|
Some solutions for n=4:
..0....0....0....1....0....1....0....2....2....0....0....0....1....0....1....2
..2....0....1....1....2....1....0....2....0....0....1....0....2....2....2....2
..1....1....2....2....1....2....0....1....0....2....1....1....0....0....2....2
..1....2....1....2....0....0....0....0....0....0....0....1....0....0....1....2
|
|
CROSSREFS
|
|
|
KEYWORD
|
nonn
|
|
AUTHOR
|
|
|
STATUS
|
approved
|
|
|
|