|
%I #12 Mar 09 2018 03:37:42
%S 0,2,78,2724,125660,8194710,735861882,87393619208,13265357282424,
%T 2504688304672170,575664637463471270,158222202489198948012,
%U 51242608446214266856788,19312113111031410277418174
%N Number 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) = Sum_{k=1..n} binomial(n, k) * ((2*k)! / 2^k - k * k!). - _Sean A. Irvine_, Mar 08 2018
%K nonn
%O 1,2
%A _Lily Yen_
|
