editing
approved
editing
approved
We omit the seed a(0) from the sequence and keep the offset at 1, because 3 is not highly composite. - R. J. Mathar, Jun 20 2021
Cf. A009287. [R. J. Mathar, Jan 26 2010]
A finite subsequence of A009287.
approved
editing
proposed
approved
editing
proposed
Chain of 6 highly composite numbers generated when subject to the recurrence relation tau(a(n+1)) = a(n), with a(0)=3, where tau(n) is the number-of-divisors function A000005(n).
Since 4 is the HCN with 3 divisors, we have tau(4) = 3 and therefore a(1)=4 ; The the HCN with 4 divisors is 6, so that tau(6) = 4 and hence a(2)=6 ; The the HCN with 6 divisors is 12 so that tau(12) = 6, implying a(3)=12, ...
Cf. A009287. [From __R. J. Mathar_, Jan 26 2010]
approved
editing
_Lekraj Beedassy (blekraj(AT)yahoo.com), _, Dec 22 2007
Cf. A009287. [From _R. J. Mathar (mathar(AT)strw.leidenuniv.nl), _, Jan 26 2010]
editing
proposed
Duplicate of A009287.
approved
editing