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!)
A333697 a(n) = Sum_{d|n} (-1)^omega(n/d) * phi(rad(n/d)) * p(d), where p = A000041 (partition numbers). 0

%I #10 Apr 03 2020 12:05:44

%S 1,1,1,2,3,6,9,14,22,31,46,59,89,114,158,201,281,337,472,570,756,936,

%T 1233,1456,1926,2323,2942,3556,4537,5334,6812,8088,10021,11997,14805,

%U 17432,21601,25507,30971,36606,44543,52106,63219,74097,88680,104281,124708,145205,173429,202124

%N a(n) = Sum_{d|n} (-1)^omega(n/d) * phi(rad(n/d)) * p(d), where p = A000041 (partition numbers).

%F a(n) = Sum_{d|n} A023900(n/d) * A000041(d).

%F a(n) = Sum_{d|n} A047968(n/d) * mu(d) * d.

%F Sum_{k=1..n} a(gcd(n,k)) = A000041(n).

%t Table[Sum[(-1)^PrimeNu[n/d] EulerPhi[Last[Select[Divisors[n/d], SquareFreeQ]]] PartitionsP[d], {d, Divisors[n]}], {n, 50}]

%o (PARI) rad(n) = factorback(factorint(n)[, 1]); \\ A007947

%o a(n) = sumdiv(n, d, (-1)^omega(n/d) * eulerphi(rad(n/d)) * numbpart(d)); \\ _Michel Marcus_, Apr 03 2020

%Y Cf. A000010, A000041, A001221, A007947, A008683, A023900, A047968, A078392.

%K nonn

%O 1,4

%A _Ilya Gutkovskiy_, Apr 02 2020

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 August 13 07:44 EDT 2024. Contains 375113 sequences. (Running on oeis4.)