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.

A332791 a(1) = 1; a(n+1) = Sum_{d|n} phi(d) * a(d).

Original entry on oeis.org

1, 1, 2, 5, 12, 49, 104, 625, 2512, 15077, 60358, 603581, 2414438, 28973257, 173840168, 1390721397, 11125773688, 178012379009, 1068074289230, 19225337206141, 153802697709496, 1845632372514581, 18456323725749392, 406039121966486625, 3248312975734309938
Offset: 1

Views

Author

Ilya Gutkovskiy, Feb 24 2020

Keywords

Crossrefs

Programs

  • Mathematica
    a[1] = 1; a[n_] := Sum[EulerPhi[d] a[d], {d, Divisors[n - 1]}]; Table[a[n], {n, 1, 25}]
    a[1] = 1; a[n_] := a[n] = Sum[a[(n - 1)/GCD[n - 1, k]], {k, 1, n - 1}]; Table[a[n], {n, 1, 25}]

Formula

a(1) = 1; a(n+1) = Sum_{k=1..n} a(n/gcd(n, k)).
a(n) = Sum_{k=1..n} a(gcd(n,k))*phi(gcd(n,k))/phi(n/gcd(n,k)). - Richard L. Ollerton, May 07 2021