login

Year-end appeal: Please make a donation to the OEIS Foundation to support ongoing development and maintenance of the OEIS. We are now in our 61st year, we have over 378,000 sequences, and we’ve reached 11,000 citations (which often say “discovered thanks to the OEIS”).

A334019
Sum of unitary divisors of n that are smaller than sqrt(n).
5
0, 1, 1, 1, 1, 3, 1, 1, 1, 3, 1, 4, 1, 3, 4, 1, 1, 3, 1, 5, 4, 3, 1, 4, 1, 3, 1, 5, 1, 11, 1, 1, 4, 3, 6, 5, 1, 3, 4, 6, 1, 12, 1, 5, 6, 3, 1, 4, 1, 3, 4, 5, 1, 3, 6, 8, 4, 3, 1, 13, 1, 3, 8, 1, 6, 12, 1, 5, 4, 15, 1, 9, 1, 3, 4, 5, 8, 12, 1, 6, 1, 3, 1, 15, 6
OFFSET
1,6
LINKS
FORMULA
a(n) = A070039(n) for squarefree numbers (A005117) or squares of primes (A001248).
EXAMPLE
The unitary divisors of 12 are {1, 3, 4, 12}, 1 and 3 are smaller than sqrt(12) and their sum is 1 + 3 = 4, hence a(12) = 4.
MATHEMATICA
a[n_] := DivisorSum[n, # &, #^2 < n && CoprimeQ[#, n/#] &]; Array[a, 100]
PROG
(PARI) a(n) = sumdiv(n, d, if(gcd(d, n/d)==1 && d<sqrt(n), d)); \\ Jinyuan Wang, Apr 12 2020
CROSSREFS
KEYWORD
nonn
AUTHOR
Amiram Eldar, Apr 12 2020
STATUS
approved