|
|
A049835
|
|
a(n) = Sum_{k=1..n} T(n,k), array T as in A049834.
|
|
3
|
|
|
1, 3, 7, 11, 19, 21, 35, 37, 49, 53, 75, 65, 99, 93, 105, 115, 151, 127, 179, 153, 181, 193, 239, 191, 257, 249, 271, 261, 339, 263, 375, 329, 361, 373, 401, 351, 487, 441, 461, 427, 563, 443, 603, 517, 535, 585, 683, 533, 697, 619, 685, 661, 811, 657, 781, 711
(list;
graph;
refs;
listen;
history;
text;
internal format)
|
|
|
OFFSET
|
1,2
|
|
COMMENTS
|
Also the sum of all the partial quotients in the continued fraction for all rational k/n, for 1 <= k <= n. - Jeffrey Shallit, Jan 31 2023
|
|
LINKS
|
|
|
FORMULA
|
Yao and Knuth proved that a(n) is asymptotically (6/Pi)^2*n*(log n)^2. - Jeffrey Shallit, Jan 31 2023
|
|
MAPLE
|
a:= n-> add(add(i, i=convert(k/n, confrac)), k=1..n):
|
|
CROSSREFS
|
|
|
KEYWORD
|
nonn
|
|
AUTHOR
|
|
|
STATUS
|
approved
|
|
|
|