105090

Appears in sequences

• Smallest number m such that the trajectory of m under iteration of cototient function[=A051953] contains exactly n distinct numbers (including m and the fixed point=0). Or: the required number of iterations[=operations,transitions] is n-1.at n=29A098197
• Regular triangle array: number of [0-r]-covering hierarchies with thickness = e.at n=48A250485