login
The OEIS is supported by the many generous donors to the OEIS Foundation.

 

Logo
Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A008274 Total length of performances of n fragments in Stockhausen problem. 0

%I #14 Mar 09 2018 03:37:39

%S 0,8,408,18768,1106960,88667160,9451834728,1299134553248,

%T 223938037975968,47323771284289320,12033854252927528120,

%U 3625294706083960689648,1276951433892702568064688

%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) = A008270(n) - Sum_{k=1..n} n! * k / (n-k)! - Sum_{k=2..n+1} n! * k * (k-2) / (n-k+1)! [from Read and Yen]. - _Sean A. Irvine_, Mar 08 2018

%K nonn

%O 1,2

%A _Lily Yen_

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Style Sheet | Transforms | Superseeker | Recents
The OEIS Community | Maintained by The OEIS Foundation Inc.

License Agreements, Terms of Use, Privacy Policy. .

Last modified July 31 01:50 EDT 2024. Contains 374774 sequences. (Running on oeis4.)