OFFSET
1,2
COMMENTS
First we add up all the divisors of n, and then we add in the divisors of each restricted divisor of n (not 1 or n itself) and continue the recursion until such a depth as that there only numbers with no restricted divisors (prime numbers).
Thus if n is prime then hypersigma(n) is the same as sigma(n).
LINKS
Alois P. Heinz, Table of n, a(n) for n = 1..10000 (first 1000 terms from Alonso del Arte)
Jon Maiga, Computer-generated formulas for A191150, Sequence Machine.
FORMULA
a(n) = n + 1 <=> n is prime. - Bill McEachen, Aug 01 2023
For n > 1, a(n) = A191161(n) - A074206(n). [Conjectured by Sequence Machine] - Antti Karttunen, Nov 22 2024
EXAMPLE
a(12) = 64 since: the sum of the divisors of 12 is 28; to 28 we add 3 and 4 (corresponding to the prime divisors 2 and 3) bringing us up to 35; for 4 and 6 we continue the recursion, with 4 bringing us up to 45 and 6 brings up to 64.
MAPLE
a:= proc(n) option remember; uses numtheory;
sigma(n)+add(a(d), d=divisors(n) minus {1, n})
end:
seq(a(n), n=1..100); # Alois P. Heinz, Aug 01 2023
MATHEMATICA
hyperSigma[1] := 1; hyperSigma[n_] := hyperSigma[n] = Module[{d=Divisors[n]}, Total[d] + Total[hyperSigma /@ Rest[Most[d]]]]; Table[hyperSigma[n], {n, 100}] (* From T. D. Noe with a slight modification *)
PROG
(PARI) A191150(n) = (sigma(n)+sumdiv(n, d, if((d>1)&&(d<n), A191150(d), 0))); \\ (after the Maple-program) - Antti Karttunen, Nov 22 2024
CROSSREFS
KEYWORD
nonn,easy
AUTHOR
Alonso del Arte, May 26 2011
EXTENSIONS
Example corrected by Paolo P. Lava, Jul 13 2011
STATUS
approved