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.

Previous Showing 11-11 of 11 results.

A244396 a(n) = Sum_{k=1, n} phi(k)*index(k, n), with phi(k) the Euler totient A000010(k) and index(k,n) the position of 1/k in the n-th row of the Farey sequence of order k, A049805(n,k).

Original entry on oeis.org

2, 5, 12, 21, 39, 54, 87, 117, 162, 204, 279, 333, 435, 516, 624, 732, 900, 1017, 1224, 1380, 1590, 1785, 2082, 2286, 2616, 2886, 3237, 3543, 4005, 4305, 4830, 5238, 5748, 6204, 6816, 7266, 8004, 8571, 9279, 9879, 10779, 11373, 12360, 13110, 14010, 14835
Offset: 1

Views

Author

Michel Marcus, Jun 27 2014

Keywords

Crossrefs

Programs

  • Mathematica
    a[n_] := With[{f = FareySequence[n]}, Sum[EulerPhi[k] FirstPosition[f, 1/k ][[1]], {k, 1, n}]]; Array[a, 50] (* Jean-François Alcover, Sep 26 2018 *)
  • PARI
    farey(n) = {vf = [0]; for (k=1, n, for (m=1, k, vf = concat(vf, m/k););); vecsort(Set(vf));}
    a(n) = my(row = farey(n)); sum(k=1, n, eulerphi(k)*vecsearch(row, 1/k));

Formula

a(n) = Sum_{k=1, n} A000010(k)*A049805(k, n).
a(n) = n^3/(6*zeta(3)) + O(n^2). (see (22) in Tomás link).
Previous Showing 11-11 of 11 results.