|
|
A039619
|
|
Second column of Jabotinsky-triangle A038455 related to A006963.
|
|
3
|
|
|
1, 9, 107, 1650, 31594, 725592, 19471500, 598482000, 20742534576, 800575997760, 34059828307680, 1583808130195200, 79925022369273600, 4350478314951982080, 254086498336122950400, 15849890120755311667200
(list;
graph;
refs;
listen;
history;
text;
internal format)
|
|
|
OFFSET
|
2,2
|
|
COMMENTS
|
Explicit formula using partitions of n into 2 parts: cf. Knuth's paper for f(n,2), n >= 2, formula with f(k) as given above.
|
|
LINKS
|
D. E. Knuth, Problem 11832,The American Mathematical Monthly, Vol. 122, No. 4 (April 2015), page 390.
|
|
FORMULA
|
a(n) = sum(binomial(n-1, j-1)*f(j)*f(n-j), j=1..n-1) with f(k) := A006963(k+1) = (2*k+1)!/k!, k >= 1.
a(n) = (H(2*n-1) - H(n)) * (2*n-1)! / n! where H() is Harmonic numbers [Knuth 2015]. - Michael Somos, May 11 2015
a(n) = (n-1)!*sum(binomial(2n-1-k, n-1-k)/k,k=1..n-1) [Callan 2015]. - David Callan, May 17 2015
|
|
EXAMPLE
|
G.f. = x^2 + 9*x^3 + 107*x^4 + 1650*x^5 + 31594*x^6 + 725592*x^7 + ...
|
|
MATHEMATICA
|
Rest[Rest[CoefficientList[Series[Log[(1-Sqrt[1-4*x])/x/2]^2/2, {x, 0, 20}], x]* Range[0, 20]!]] (* Vaclav Kotesovec, Oct 07 2013 *)
a[ n_] := If[ n < 1, 0, Sum[ 1/k, {k, n + 1, 2 n - 1}] (2 n - 1)!/n!]; (* Michael Somos, May 11 2015 *)
a[ n_] := If[ n < 1, 0, Sum[ Times @@ Drop[ Range[ n - 1] + n, {k}], {k, n - 1}]]; (* Michael Somos, May 11 2015 *)
|
|
PROG
|
(PARI) {a(n) = if( n<1, 0, sum(k=n+1, 2*n-1, 1/k) * (2*n-1)! / n!)}; /* Michael Somos, May 11 2015 */
|
|
CROSSREFS
|
|
|
KEYWORD
|
nonn
|
|
AUTHOR
|
|
|
STATUS
|
approved
|
|
|
|