A008270 Total length of strings on n symbols in Stockhausen problem.

1, 20, 507, 19552, 1113485, 88725876, 9452410135, 1299140690912, 223938108997497, 47323772172058420, 12033854264863090451, 3625294706255832787200, 1276951433895343148472517

Offset

1,2

Links

Table of n, a(n) for n=1..13.

R. C. Read, Combinatorial problems in theory of music, Discrete Math. 167 (1997), 543-551.

Ronald C. Read, Lily Yen, A note on the Stockhausen problem, J. Comb. Theory, Ser. A 76, No. 1 (1996), 1-10.

Formula

a(n) = n * Sum_{k=0..n-1} binomial(n - 1, k) * (2*k+1) * (2*k+1)! / 2^k. - Sean A. Irvine, Mar 08 2018

Crossrefs

Sequence in context: A270578 A255492 A092087 * A130186 A130033 A250016

Adjacent sequences: A008267 A008268 A008269 * A008271 A008272 A008273

Keyword

nonn

Author

Lily Yen

Status

approved