|
|
A008271
|
|
Number of performances of n fragments in Stockhausen problem.
|
|
2
|
|
|
0, 2, 114, 5844, 380900, 32817990, 3679720422, 524366318504, 92857556215944, 20037507147592650, 5180981746936701530, 1582222025035216228092, 563668692910591272692844, 231745357332413891454727694
(list;
graph;
refs;
listen;
history;
text;
internal format)
|
|
|
OFFSET
|
1,2
|
|
LINKS
|
|
|
FORMULA
|
Recurrence: (n-2)*(3*n-7)*a(n) = (n-1)*n*(6*n^2 - 17*n + 16)*a(n-1) - (n-1)*n*(12*n^2 - 37*n + 29)*a(n-2) + 2*(n-2)*(n-1)*n*(3*n-4)*a(n-3). - Vaclav Kotesovec, Feb 18 2015
a(n) ~ sqrt(Pi) * 2^(n+1) * n^(2*n+3/2) / exp(2*n). - Vaclav Kotesovec, Feb 18 2015
|
|
MATHEMATICA
|
Table[n*Sum[Binomial[n-1, i]*(2*i)!*i*(2*i-1)/2^i, {i, 0, n-1}], {n, 1, 20}] (* Vaclav Kotesovec, Feb 18 2015 after R. C. Read *)
|
|
PROG
|
(PARI) for(n=1, 25, print1(n*sum(k=0, n-1, binomial(n-1, k)*(2*k)!*k*(2*k-1)/2^k), ", ")) \\ G. C. Greubel, Apr 11 2017
|
|
CROSSREFS
|
|
|
KEYWORD
|
nonn
|
|
AUTHOR
|
|
|
STATUS
|
approved
|
|
|
|