|
|
A036457
|
|
Numbers k for which exactly 5 applications of A000005 are needed to reach 2.
|
|
4
|
|
|
60, 72, 84, 90, 96, 108, 126, 132, 140, 150, 156, 160, 180, 198, 200, 204, 220, 224, 228, 234, 240, 252, 260, 276, 288, 294, 300, 306, 308, 315, 336, 340, 342, 348, 350, 352, 360, 364, 372, 380, 392, 396, 414, 416, 420, 432, 444, 450, 460, 468, 476, 480
(list;
graph;
refs;
listen;
history;
text;
internal format)
|
|
|
OFFSET
|
1,1
|
|
COMMENTS
|
|
|
LINKS
|
|
|
FORMULA
|
d(d(d(d(d(a(n))))))) = 2 for all n.
|
|
EXAMPLE
|
a(13)=180; the successive iterates are 18, 6, 4, 3, and finally the 5th is 2;
a(3)=84; divisor numbers are 12, 6, 4, 3, and 2.
|
|
MAPLE
|
if n <= 2 then 0 else 1 + procname(numtheory:-tau(n)) fi
end proc:
|
|
MATHEMATICA
|
Select[Range@ 480, Last@ # == 2 && #[[5]] != 2 &@ NestList[DivisorSigma[0, #] &, #, 5] &] (* Michael De Vlieger, Jan 26 2016 *)
|
|
PROG
|
|
|
CROSSREFS
|
|
|
KEYWORD
|
nonn
|
|
AUTHOR
|
|
|
EXTENSIONS
|
|
|
STATUS
|
approved
|
|
|
|