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!)
A332791 a(1) = 1; a(n+1) = Sum_{d|n} phi(d) * a(d). 4
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 (list; graph; refs; listen; history; text; internal format)
OFFSET
1,3
LINKS
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
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}]
CROSSREFS
Sequence in context: A334811 A071787 A343813 * A291484 A145997 A067578
KEYWORD
nonn
AUTHOR
Ilya Gutkovskiy, Feb 24 2020
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 April 23 05:37 EDT 2024. Contains 371906 sequences. (Running on oeis4.)