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”).

A362401
Numbers in the range of A162296, where A162296(n) is the sum of divisors of n that have a square factor larger than 1.
5
0, 4, 9, 12, 16, 24, 25, 27, 28, 32, 36, 48, 49, 54, 56, 60, 72, 75, 79, 80, 96, 100, 108, 112, 117, 120, 121, 124, 126, 128, 144, 147, 150, 152, 162, 168, 169, 176, 180, 183, 192, 196, 199, 200, 216, 224, 240, 248, 252, 268, 270, 272, 288, 289, 294, 296, 300
OFFSET
1,2
COMMENTS
Possible values of A162296 in increasing order.
LINKS
EXAMPLE
0 is a term since A162296(k) = 0 if k is squarefree (A005117).
MATHEMATICA
s[n_] := Module[{f = FactorInteger[n], p, e}, p = f[[;; , 1]]; e = f[[;; , 2]]; Times @@ ((p^(e + 1) - 1)/(p - 1)) - Times @@ (p + 1)]; s[1] = 0; m = 300; Select[Union[Array[s, m]], # <= m &]
PROG
(PARI) s(n) = {my(f = factor(n), p, e); prod(i = 1, #f~, p = f[i, 1]; e = f[i, 2]; ((p^(e + 1) - 1)/(p - 1))) - prod(i = 1, #f~, f[i, 1] + 1); }
lista(kmax) = select(x -> (x < kmax), Set(vector(kmax, k, s(k))))
CROSSREFS
Similar sequences: A078923, A002191, A002202, A002174, A274790.
Sequence in context: A309134 A312858 A312859 * A045673 A292226 A225870
KEYWORD
nonn
AUTHOR
Amiram Eldar, Apr 18 2023
STATUS
approved