login
Total length of performances of n fragments in Stockhausen problem.
0

%I #13 Mar 09 2018 03:37:46

%S 0,10,732,47868,3848320,395925990,51677715180,8406604850392,

%T 1673689684372128,401132372917509090,114061334769253037980,

%U 37993391290097065722900,14661377074205783294317152

%N Total length of performances of n fragments in Stockhausen problem.

%H R. C. Read, <a href="http://dx.doi.org/10.1016/S0012-365X(96)00255-5">Combinatorial problems in theory of music</a>, Discrete Math. 167 (1997), 543-551.

%H Ronald C. Read, Lily Yen, <a href="https://doi.org/10.1006/jcta.1996.0085">A note on the Stockhausen problem</a>, J. Comb. Theory, Ser. A 76, No. 1 (1996), 1-10.

%F a(n) = 3 * A008271(n) + n * (n-1) * Sum_{k=0..n-2} binomial(n - 2, k) * (2 * k + 1) * (2 * k + 1)! * (2*k^2+3*k+2) / 2^k [from Read and Yen]. - _Sean A. Irvine_, Mar 08 2018

%K nonn

%O 1,2

%A _Lily Yen_