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!)
A173440 Number of divisors d of number n such that sigma(d) does not divide sigma(n). 2

%I #15 Nov 26 2017 07:15:32

%S 0,0,0,1,0,0,0,1,1,0,0,2,0,0,0,3,0,2,0,1,0,0,0,2,1,0,1,2,0,0,0,2,0,0,

%T 0,5,0,0,0,2,0,0,0,1,2,0,0,6,1,2,0,2,0,2,0,2,0,0,0,2,0,0,1,5,0,0,0,1,

%U 0,0,0,6,0,0,2,2,0,0,0,5,3,0,0,4,0,0,0,2,0,4,0,1,0,0,0,4,0,2,1,5,0,0,0,1,0

%N Number of divisors d of number n such that sigma(d) does not divide sigma(n).

%C a(n) = A000005(n) - A173439(n).

%C a(n) = 0 for squarefree numbers (A005117).

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

%e For n = 12: a(12) = 2; sigma(12) = 28, divisors of 12: 1, 2, 3, 4, 6, 12; corresponding sigma(d):1, 3, 4, 7, 12, 28; sigma(d) does not divide sigma(n) for 2 divisors d: 2 and 6.

%t Table[DivisorSum[n, 1 &, ! Divisible[DivisorSigma[1, n], DivisorSigma[1, #]] &], {n, 105}] (* _Michael De Vlieger_, Nov 23 2017 *)

%o (PARI)

%o A173439(n) = { my(s=sigma(n)); sumdiv(n,d,!(s%sigma(d))); };

%o A173440(n) = (numdiv(n) - A173439(n)); \\ _Antti Karttunen_, Nov 23 2017

%o (Sage) A173440 = lambda n: len([d for d in divisors(n) if not sigma(d).divides(sigma(n))]) # _D. S. McNeil_, Dec 08 2010

%Y Cf. A000005, A000203, A005117, A173439.

%K nonn

%O 1,12

%A _Jaroslav Krizek_, Feb 18 2010

%E Edited and extended by _D. S. McNeil_, Dec 08 2010

%E More terms from _Antti Karttunen_, Nov 23 2017

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 19 08:45 EDT 2024. Contains 371782 sequences. (Running on oeis4.)