A174987 Start with n, iterate the map k -> A167507(k) until we reach 3, 4, 5 or 6; a(n) = which of 3, 4, 5 or 6 we reach first.
4, 4, 4, 3, 4, 5, 6, 4, 4, 4, 3, 4, 5, 6, 4, 6, 5, 4, 4, 4, 5, 4, 4, 3, 4, 4, 4, 4, 4, 4, 6, 3, 3, 4, 5, 3, 4, 3, 3, 3, 4, 5, 5, 6, 4, 5, 4, 5, 5, 5, 4, 6, 6, 4, 6, 6, 5, 6, 6, 6, 4, 5, 5, 6, 4, 5, 4, 5, 5, 5, 4, 4, 6, 4, 5, 4, 6, 6, 6, 6, 5, 6, 6, 5, 4, 6, 4, 6, 6, 6, 4, 6, 5, 4, 4, 4, 5, 4, 4, 4
Offset: 1
Extensions
Edited by N. J. A. Sloane, Apr 05 2010