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!)
A092509 Möbius transform of sequence A008475. 2

%I #14 Nov 17 2017 20:32:23

%S 0,2,3,2,5,0,7,4,6,0,11,0,13,0,0,8,17,0,19,0,0,0,23,0,20,0,18,0,29,0,

%T 31,16,0,0,0,0,37,0,0,0,41,0,43,0,0,0,47,0,42,0,0,0,53,0,0,0,0,0,59,0,

%U 61,0,0,32,0,0,67,0,0,0,71,0,73,0,0,0,0,0,79,0,54,0,83,0,0,0,0,0,89,0,0,0,0

%N Möbius transform of sequence A008475.

%H Antti Karttunen, <a href="/A092509/b092509.txt">Table of n, a(n) for n = 1..16384</a>

%F a(n) = 0 if n is 1 or not a power of a prime;

%F a(n) = n if n is a prime;

%F a(n) = n*(1 -1/p) if n = p^k, k>= 2, p=prime.

%F a(n) = Sum_{d|n} A008683(d)*A008475(n/d). - _Antti Karttunen_, Nov 17 2017

%t f[n_] := Plus @@ Map[Power @@ #1 &, FactorInteger[n]]; mt[n_] := Block[{d = Divisors[n]}, Plus @@ (MoebiusMu /@ (n/d)*f /@ d)]; Table[ mt[n], {n, 93}] (* _Robert G. Wilson v_, Jan 12 2005 *)

%o (PARI)

%o A008475(n) = { my(f=factor(n)); vecsum(vector(#f~,i,f[i,1]^f[i,2])); };

%o A092509(n) = sumdiv(n,d,moebius(d)*A008475(n/d)); \\ _Antti Karttunen_, Nov 17 2017

%Y Cf. A008475, A008683.

%K nonn

%O 1,2

%A _Leroy Quet_, Dec 31 2004

%E More terms from _Robert G. Wilson v_, Jan 13 2005

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 15:57 EDT 2024. Contains 371961 sequences. (Running on oeis4.)