cp's OEIS Frontend

This is a front-end for the Online Encyclopedia of Integer Sequences, made by Christian Perfect. The idea is to provide OEIS entries in non-ancient HTML, and then to think about how they're presented visually. The source code is on GitHub.

A332342 Table T(n, k) read by antidiagonals upwards: sum of the terms of the continued fraction for the fractional part of n/k (n>=1, k>=1).

Original entry on oeis.org

0, 0, 2, 0, 0, 3, 0, 2, 3, 4, 0, 0, 0, 2, 5, 0, 2, 3, 4, 4, 6, 0, 0, 3, 0, 4, 3, 7, 0, 2, 0, 4, 5, 2, 5, 8, 0, 0, 3, 2, 0, 3, 5, 4, 9, 0, 2, 3, 4, 5, 6, 5, 5, 6, 10, 0, 0, 0, 0, 4, 0, 5, 2, 3, 5, 11, 0, 2, 3, 4, 4, 6, 7, 5, 6, 6, 7, 12, 0, 0, 3, 2, 5, 3, 0, 4, 6, 4, 6, 6, 13
Offset: 1

Views

Author

Andrey Zabolotskiy, Feb 10 2020

Keywords

Examples

			2/7 = 1/(3+1/2), so T(2, 7) = 3 + 2 = 5.
The table begins:
0 2 3 4 5 6 7 8 9 ...
0 0 3 2 4 3 5 4 6 ...
0 2 0 4 4 2 5 5 3 ...
0 0 3 0 5 3 5 2 6 ...
0 2 3 4 0 6 5 5 6 ...
0 0 0 2 5 0 7 4 3 ...
...
		

Crossrefs

Programs

  • Mathematica
    t[n_,k_] := Total@ ContinuedFraction@ FractionalPart[n/k];
    Flatten[Table[t[nk+k-1,k], {nk,10}, {k,nk}]]
  • Python
    def cofr(p, q):
        return [] if q == 0 else [p // q] + cofr(q, p % q)
    def t(n, k):
        return sum(cofr(n, k)[1:])
    tr = []
    for nk in range(1, 20):
        for k in range(1, nk+1):
            tr.append(t(nk+1-k, k))
    print(tr)