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!)
A341639 a(1) = 1; a(n+1) = Sum_{d|n} phi(d) * a(d) * a(n/d). 0

%I #4 Feb 16 2021 21:18:14

%S 1,1,2,6,19,95,291,2037,10203,71429,357240,3929640,19648533,255430929,

%T 1788018540,16092167088,144829514049,2462101738833,17234712244012,

%U 327459532636228,2947135794083881,38312765323095109,421440418557975839,9693129626833444297,87238166641520673597

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

%F a(1) = 1; a(n+1) = Sum_{k=1..n} a(gcd(n,k)) * a(n/gcd(n,k)).

%t a[1] = 1; a[n_] := a[n] = Sum[EulerPhi[d] a[d] a[(n - 1)/d], {d, Divisors[n - 1]}]; Table[a[n], {n, 25}]

%t a[1] = 1; a[n_] := a[n] = Sum[a[GCD[n - 1, k]] a[(n - 1)/GCD[n - 1, k]], {k, n - 1}]; Table[a[n], {n, 25}]

%Y Cf. A000010, A038044, A038045, A332791.

%K nonn

%O 1,3

%A _Ilya Gutkovskiy_, Feb 16 2021

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 September 11 02:28 EDT 2024. Contains 375813 sequences. (Running on oeis4.)