A349658 Number of nonrefactorable divisors of n.
0, 0, 1, 1, 1, 2, 1, 1, 1, 2, 1, 3, 1, 2, 3, 2, 1, 2, 1, 4, 3, 2, 1, 3, 2, 2, 2, 4, 1, 6, 1, 3, 3, 2, 3, 3, 1, 2, 3, 4, 1, 6, 1, 4, 4, 2, 1, 5, 2, 4, 3, 4, 1, 4, 3, 4, 3, 2, 1, 8, 1, 2, 4, 4, 3, 6, 1, 4, 3, 6, 1, 3, 1, 2, 5, 4, 3, 6, 1, 5, 3, 2, 1, 8, 3, 2, 3, 4, 1, 8, 3, 4
Offset: 1
Keywords
Links
- Antti Karttunen, Table of n, a(n) for n = 1..20000
- Eric Weisstein's World of Mathematics, Refactorable Number
Programs
-
Mathematica
a[n_] := DivisorSum[n, 1 &, !Divisible[#, DivisorSigma[0, #]] &]; Array[a, 100] (* Amiram Eldar, Nov 24 2021 *)
-
PARI
a(n) = sumdiv(n, d, d%numdiv(d) != 0); \\ Michel Marcus, Nov 24 2021
Formula
a(p) = 1 for odd primes p. - Wesley Ivan Hurt, Nov 28 2021