|
|
A191161
|
|
Hypersigma(n), definition 2: sum of the divisors of n plus the recursive sum of the divisors of the proper divisors.
|
|
3
|
|
|
1, 4, 5, 12, 7, 22, 9, 32, 19, 30, 13, 72, 15, 38, 37, 80, 19, 90, 21, 96, 47, 54, 25, 208, 39, 62, 65, 120, 31, 178, 33, 192, 67, 78, 65, 316, 39, 86, 77, 272, 43, 222, 45, 168, 147, 102, 49, 560, 67, 174, 97, 192, 55
(list;
graph;
refs;
listen;
history;
text;
internal format)
|
|
|
OFFSET
|
1,2
|
|
COMMENTS
|
In wanting to ensure the definition was not arbitrary, I initially thought that 1s had to stop the recursion. But as T. D. Noe showed me, this doesn't have to be the case: the 1s can be included in the recursion.
|
|
LINKS
|
|
|
FORMULA
|
|
|
MATHEMATICA
|
hsTD[n_] := hsTD[n] = Module[{d = Divisors[n]}, Total[d] + Total[hsTD /@ Most[d]]]; Table[hsTD[n], {n, 100}] (* From T. D. Noe *)
|
|
PROG
|
|
|
CROSSREFS
|
|
|
KEYWORD
|
nonn,easy
|
|
AUTHOR
|
|
|
STATUS
|
approved
|
|
|
|