Timeline for Factor-counting sequence

9 events

when toggle format	what		by	license	comment
Nov 20, 2020 at 12:51	history	edited	Alessandro Della Corte	CC BY-SA 4.0	added 105 characters in body
Nov 20, 2020 at 12:46	history	edited	Alessandro Della Corte	CC BY-SA 4.0	added 105 characters in body
Nov 20, 2020 at 12:27	comment	added	Alessandro Della Corte		Maybe it's also worth pointing out the even more trivial bound $\mathcal{M}_n< n$. Also notice: $$\text{every prime appears in the sequence}\implies$$ $$3\ \text{appears infinitely many times}\implies$$ $$\text{every natural number appears in the sequence}$$
Nov 20, 2020 at 9:14	history	edited	Alessandro Della Corte		edited tags
Nov 20, 2020 at 9:07	comment	added	Ilya Bogdanov		Clearly, $\mathcal M_n\geq \sqrt{n-1}$: if none of the first $n-1$ terms is greater than $\sqrt{n-1}$, then at least one number appears there $\geq \sqrt{n-1}$ times; the last one would be followed by a large term.
Nov 20, 2020 at 8:43	history	edited	Alessandro Della Corte		edited tags
Nov 20, 2020 at 0:59	history	edited	Alessandro Della Corte	CC BY-SA 4.0	edited tags
Nov 20, 2020 at 0:34	history	edited	Alessandro Della Corte	CC BY-SA 4.0	deleted 5 characters in body
Nov 20, 2020 at 0:28	history	asked	Alessandro Della Corte	CC BY-SA 4.0