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

A163107
a(n) = tau(tau(sigma(n))), where tau = A000005, the number of divisors, and sigma = A000203, the sum of divisors of n.
2
1, 2, 2, 2, 3, 4, 3, 3, 2, 4, 4, 4, 3, 4, 4, 2, 4, 3, 4, 4, 4, 3, 4, 6, 2, 4, 4, 4, 4, 6, 4, 4, 4, 4, 4, 3, 3, 6, 4, 6, 4, 6, 4, 6, 4, 6, 4, 4, 3, 3, 6, 4, 4, 5, 6, 5, 4, 6, 6, 5, 3, 6, 4, 2, 6, 4, 4, 6, 6, 4, 6, 4, 3, 4, 4, 6, 6, 5, 4, 4, 2, 6, 6, 6, 6, 6, 5, 6, 6, 6, 4, 5, 4, 4, 5, 6, 4, 4, 6, 3, 4, 5, 4, 5, 4
OFFSET
1,2
COMMENTS
Repeated application of tau (number of divisors) and sigma (sum of divisors).
LINKS
FORMULA
MAPLE
with(numtheory) : A163107 := proc(n) tau(tau(sigma(n))) ; end: seq(A163107(n), n=1..120) ; # R. J. Mathar, Jul 27 2009
MATHEMATICA
DivisorSigma[0, DivisorSigma[0, DivisorSigma[1, Range[110]]]] (* Harvey P. Dale, Nov 25 2016 *)
PROG
(PARI) A163107(n) = numdiv(numdiv(sigma(n))); \\ Antti Karttunen, Nov 07 2017
CROSSREFS
KEYWORD
nonn
AUTHOR
Jaroslav Krizek, Jul 20 2009
EXTENSIONS
More terms from R. J. Mathar, Jul 27 2009
STATUS
approved