cp's OEIS Frontend

A350743 Number of numbers k, 1 <= k <= n, such that k | sigma_k(n).

%I A350743 #27 Jan 18 2022 03:29:37
%S A350743 1,1,2,1,3,3,2,3,1,5,4,5,4,5,6,1,5,4,3,7,4,5,5,8,1,7,6,6,8,9,3,5,8,7,
%T A350743 9,3,4,10,6,13,7,8,4,8,9,7,9,5,3,5,10,10,7,13,8,14,8,12,10,18,3,10,7,
%U A350743 1,14,10,5,16,11,12,5,12,6,9,10,10,8,14,5,11,2,13,13,15,14
%N A350743 Number of numbers k, 1 <= k <= n, such that k | sigma_k(n).
%F A350743 a(n) = n - Sum_{k=1..n} (ceiling(sigma_k(n)/k) - floor(sigma_k(n)/k)).
%e A350743 a(3) = 2; we have 1 | sigma_1(3) = 1 + 3 = 4 and 2 | sigma_2(3) = 1^2 + 3^2 = 10. (Note that 3 does not divide sigma_3(3) = 1^3 + 3^3 = 28.)
%t A350743 Table[n - Sum[Ceiling[DivisorSigma[k, n]/k] - Floor[DivisorSigma[k, n]/k], {k, n}], {n, 100}]
%o A350743 (PARI) a(n) = sum(k=1, n, (sigma(n,k) % k) == 0); \\ _Michel Marcus_, Jan 13 2022
%o A350743 (Python)
%o A350743 from math import prod
%o A350743 from sympy import factorint
%o A350743 def A350743(n):
%o A350743     f = list(factorint(n).items())
%o A350743     return sum(1 for k in range(1,n+1) if prod(p**((q+1)*k)-1 for p,q in f)//prod(p**k-1 for p,q in f) % k == 0) # _Chai Wah Wu_, Jan 17 2022
%Y A350743 Cf. A000203 (sigma), A348399.
%K A350743 nonn
%O A350743 1,3
%A A350743 _Wesley Ivan Hurt_, Jan 13 2022