login
A243129
a(n) = sigma(d(d(d(n)))), where d(n) is the number of divisors of n.
1
1, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 4, 3, 3, 3, 3, 3, 4, 3, 4, 3, 3, 3, 4, 3, 3, 3, 4, 3, 4, 3, 4, 3, 3, 3, 3, 3, 3, 3, 4, 3, 4, 3, 4, 4, 3, 3, 4, 3, 4, 3, 4, 3, 4, 3, 4, 3, 3, 3, 7, 3, 3, 4, 3, 3, 4, 3, 4, 3, 4, 3, 7, 3, 3, 4, 4, 3, 4, 3, 4, 3, 3, 3, 7, 3, 3
OFFSET
1,2
COMMENTS
a(n) >= 3 for n > 1 with a(1) = 1. If n is a prime or a semiprime, a(n) = 3. The converse is not true since a(8) = 3, but 8 is neither a prime nor a semiprime.
LINKS
FORMULA
EXAMPLE
a(12) = 4; 12 has 6 divisors --> 6 has 4 divisors --> 4 has 3 divisors --> and the sum of the divisors of 3 is 4.
MAPLE
with(numtheory); A243129:=n->sigma(tau(tau(tau(n)))); seq(A243129(n), n=1..100);
MATHEMATICA
Table[DivisorSigma[1, DivisorSigma[0, DivisorSigma[0, DivisorSigma[0, n]]]], {n, 100}]
Table[DivisorSigma[1, Nest[DivisorSigma[0, #]&, n, 3]], {n, 100}] (* Harvey P. Dale, Mar 24 2016 *)
CROSSREFS
Sequence in context: A175797 A358475 A335550 * A135717 A335465 A079083
KEYWORD
nonn,easy
AUTHOR
Wesley Ivan Hurt, May 29 2014
STATUS
approved