49074

Appears in sequences

• Base-15 Armstrong or narcissistic numbers (written in base 10).at n=19A161952
• For k > a(n), the maximum number of steps that the Euclidean algorithm requires for computing (k,i), with i < k, is greater than n.at n=16A188224