|
|
A100622
|
|
Expansion of e.g.f. exp( (1+2*x-sqrt(1-4*x))/4).
|
|
2
|
|
|
1, 1, 2, 10, 94, 1286, 22876, 499612, 12925340, 386356924, 13099953016, 496719289496, 20825694943912, 956599393819720, 47772070664027984, 2577034852683364816, 149335440671982405136, 9251650217381166689552, 610194993478502245703200, 42688019374465782644235424
(list;
graph;
refs;
listen;
history;
text;
internal format)
|
|
|
OFFSET
|
0,3
|
|
COMMENTS
|
Number of topologically distinct solutions to the clone ordering problem for n clones.
|
|
LINKS
|
|
|
FORMULA
|
a(n) = n! for n = 0, 1, 2. a(n) = (4n-5) * a(n-1) - (4n-7) * a(n-2) + (n-2) * a(n-3) for n > 2. - Lee A. Newberg, Oct 18 2006
E.g.f.: exp( (1 + 2*x - sqrt(1 - 4*x)) / 4). - Michael Somos, Jan 03 2015
0 = a(n)*(+a(n+1) - 5*a(n+2) + 7*a(n+3) - a(n+4)) + a(n+1)*(-3*a(n+1) + 17*a(n+2) - 23*a(n+3) + 4*a(n+4)) + a(n+2)*(-8*a(n+2) + 12*a(n+3) - 4*a(n+4)) + a(n+3)*(+4*a(n+3)) for all n>-2. - Michael Somos, Jan 03 2015
|
|
EXAMPLE
|
G.f. = 1 + x + 2*x^2 + 10*x^3 + 94*x^4 + 1286*x^5 + 22876*x^6 + 499612*x^7 + ...
|
|
MAPLE
|
a := proc(n) option remember: if n = 0 then factorial(0) elif n = 1 then factorial(1) elif n = 2 then factorial(2) elif n >= 3 then (4*n-5)*procname(n-1) - (4*n-7)*procname(n-2) + (n-2)*procname(n-3) fi; end:
|
|
MATHEMATICA
|
CoefficientList[Series[Exp[(1+2*x-Sqrt[1-4*x])/4], {x, 0, 20}], x]* Range[0, 20]! (* Vaclav Kotesovec, Jun 26 2013 *)
|
|
PROG
|
(PARI) {a(n) = if( n<0, 0, n! * polcoeff( exp( (1 + 2*x - sqrt(1 - 4*x + x * O(x^n))) / 4), n))}; /* Michael Somos, Jan 03 2015 */
|
|
CROSSREFS
|
E.g.f. (1+2*x-sqrt(1-4*x))/4 gives A000407.
|
|
KEYWORD
|
nonn
|
|
AUTHOR
|
|
|
STATUS
|
approved
|
|
|
|