The OEIS mourns the passing of Jim Simons and is grateful to the Simons Foundation for its support of research in many branches of science, including the OEIS.
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!)
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
C. Aistleitner, B. Borda, and M. Hauke, On the distribution of partial quotients of reduced fractions with fixed denominator, ArXiv preprint arXiv:2210.14095 [math.NT], October 25 2022.
M. Shrader-Frechette, Modified Farey sequences and continued fractions, Math. Mag., 54 (1981), 60-63.
A. C. Yao and D. E. Knuth, Analysis of the subtractive algorithm for greatest common divisors, Proc. Nat. Acad. Sci. USA 72 (1975), 4720-4722.
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):
seq(a(n), n=1..60); # Alois P. Heinz, Jan 31 2023
CROSSREFS
Sequence in context: A244570 A049645 A167181 * A117510 A160227 A134442
KEYWORD
nonn
AUTHOR
STATUS
approved

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 May 14 07:07 EDT 2024. Contains 372528 sequences. (Running on oeis4.)