|
|
|
|
1, 2, 21, 552, 27385, 2205840, 262793181, 43462178816, 9531675497457, 2677576265015040, 937689127821286885, 400556244184058840064, 205018515960316713766761, 123868925489567035630641152, 87231398219233211815174239405, 70827813121227086927005549854720, 65683870009665683776967740707164641
(list;
graph;
refs;
listen;
history;
text;
internal format)
|
|
|
OFFSET
|
1,2
|
|
LINKS
|
|
|
FORMULA
|
Sergey Fomin and Grigory Mikhalkin give a recurrence.
|
|
MATHEMATICA
|
terms = 17; Clear[b]; b[1] = b[2] = 1;
y[x_] = Sum[d^2 b[d] x^d/(2 d)!, {d, 1, terms+1}];
f = x (4 y'[x] - E^y[x] - x E^y[x] y'[x]) - 2 y[x] + O[x]^(terms + 1);
Solve[0 == Thread[CoefficientList[f, x]]][[1]] /. Rule -> Set;
a[n_] := n b[n];
|
|
CROSSREFS
|
|
|
KEYWORD
|
nonn
|
|
AUTHOR
|
|
|
EXTENSIONS
|
|
|
STATUS
|
approved
|
|
|
|