35209

Appears in sequences

• Smallest number m such that the trajectory of m under iteration of Euler's totient function phi(n) [A000010] contains exactly n distinct numbers, including m and the fixed point.at n=16A007755
• Apart from initial terms, same as A007755, which is a better version.at n=15A040176
• Semiperimeter of primitive Pythagorean triangles having legs that add up to a square, sorted on hypotenuse.at n=24A089549
• Smallest nonprime number which if used as initial term for iteration of the A000010[x] function, results in list-to-fixed-point of length=n, or 0 if no such number exists.at n=16A098196
• Smallest k such that phi(phi(k)) = 2^n, where phi is the Euler totient function.at n=13A184968
• Number of ascent sequences of length n with exactly eight descents.at n=1A241878
• Numbers n such that (n^n-2)/(n-2) is an integer.at n=34A242787
• Totient highly abundant numbers that are composite.at n=12A286322
• Positive integers m with m^k - 1 (k = 1,...,13) all practical.at n=29A294307
• Composite terms of A007755.at n=3A309672
• Composite terms of A181659, where the sum of the iterated totient function attains a record.at n=6A332737