|
|
A008270
|
|
Total length of strings on n symbols in Stockhausen problem.
|
|
1
|
|
|
1, 20, 507, 19552, 1113485, 88725876, 9452410135, 1299140690912, 223938108997497, 47323772172058420, 12033854264863090451, 3625294706255832787200, 1276951433895343148472517
(list;
graph;
refs;
listen;
history;
text;
internal format)
|
|
|
OFFSET
|
1,2
|
|
LINKS
|
|
|
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
|
|
|
KEYWORD
|
nonn
|
|
AUTHOR
|
|
|
STATUS
|
approved
|
|
|
|