206910

Appears in sequences

• Smallest number m such that when A051953 is applied n times to m the result is neither a power of 2 nor 0.at n=24A053476
• 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=31A098197
• Number of n X 7 0..1 arrays avoiding 0 0 0 and 0 1 0 horizontally and 0 0 1 and 1 1 0 vertically.at n=4A207702
• Number of 5Xn 0..1 arrays avoiding 0 0 0 and 0 1 0 horizontally and 0 0 1 and 1 1 0 vertically.at n=6A207706
• Numbers n of the form 4*k+2 such that (sigma(n) mod n) divides n, where sigma is given by A000203.at n=12A254999