A333751 Sum of nonprime divisors of n that are <= sqrt(n).
1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 5, 1, 1, 1, 5, 1, 1, 1, 5, 1, 1, 1, 5, 1, 1, 1, 5, 1, 1, 1, 11, 1, 1, 1, 5, 1, 7, 1, 5, 1, 1, 1, 11, 1, 1, 1, 5, 1, 7, 1, 5, 1, 1, 1, 11, 1, 1, 1, 13, 1, 7, 1, 5, 1, 1, 1, 19, 1, 1, 1, 5, 1, 7, 1, 13, 10, 1, 1, 11, 1, 1, 1, 13, 1, 16
Offset: 1
Keywords
Links
- Robert Israel, Table of n, a(n) for n = 1..10000
Programs
-
Maple
f:= proc(n) convert(select(t -> not isprime(t) and t^2 <= n, numtheory:-divisors(n)),`+`) end proc: map(f, [$1..100]); # Robert Israel, Sep 12 2024
-
Mathematica
Table[DivisorSum[n, # &, # <= Sqrt[n] && !PrimeQ[#] &], {n, 1, 90}] nmax = 90; CoefficientList[Series[Sum[Boole[!PrimeQ[k]] k x^(k^2)/(1 - x^k), {k, 1, nmax}], {x, 0, nmax}], x] // Rest
-
PARI
a(n) = sumdiv(n, d, if ((d^2<=n) && !isprime(d), d)); \\ Michel Marcus, Apr 03 2020