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!)
A346114 a(n+1) = 1 + Sum_{k=1..n} a(gcd(n,k)). 0
1, 2, 4, 7, 12, 17, 28, 35, 51, 66, 91, 102, 150, 163, 210, 259, 325, 342, 454, 473, 608, 701, 823, 846, 1099, 1168, 1355, 1500, 1786, 1815, 2290, 2321, 2711, 2954, 3328, 3537, 4302, 4339, 4848, 5221, 6075, 6116, 7269, 7312, 8306, 9059, 9949, 9996, 11795, 12006 (list; graph; refs; listen; history; text; internal format)
OFFSET
1,2
LINKS
FORMULA
G.f. A(x) satisfies: A(x) = x * (1 / (1 - x) + Sum_{k>=1} phi(k) * A(x^k)).
a(1) = 1; a(n+1) = 1 + Sum_{d|n} phi(n/d) * a(d).
MATHEMATICA
a[n_] := a[n] = 1 + Sum[a[GCD[n - 1, k]], {k, 1, n - 1}]; Table[a[n], {n, 1, 50}]
nmax = 50; A[_] = 0; Do[A[x_] = x (1/(1 - x) + Sum[EulerPhi[k] A[x^k], {k, 1, nmax}]) + O[x]^(nmax + 1) // Normal, nmax + 1]; CoefficientList[A[x], x] // Rest
CROSSREFS
Sequence in context: A181020 A049631 A239955 * A332744 A345731 A084672
KEYWORD
nonn
AUTHOR
Ilya Gutkovskiy, Jul 05 2021
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 24 14:54 EDT 2024. Contains 371960 sequences. (Running on oeis4.)