Year-end appeal: Please make a donation to the OEIS Foundation to support ongoing development and maintenance of the OEIS. We are now in our 61st year, we have over 378,000 sequences, and we’ve reached 11,000 citations (which often say “discovered thanks to the OEIS”).
%I #8 Apr 25 2020 03:19:23
%S 2,3,2,1,1,1,1,2,2,2,2,2,2,2,3,2,2,3,3,3,2,3,3,3,3,3,3,3,3,3,2,3,3,3,
%T 3,3,3,3,3,3,3,3,3,3,4,3,3,3,3,3,3,3,3,4,3,3,3,3,3,3,3,3,3,3,4,3,3,3,
%U 3,3,3,4,3,4,3,4,3,3,3,3,3,3,3,3,4,3,4,3,3,3,4,3,3,4,4,4,3,4,4,4
%N Start with n, iterate the map k -> A167507(k) until we reach 3, 4, 5 or 6; a(n) = number of steps required.
%Y Cf. A167507, A174984, A174987.
%K nonn,word
%O 1,1
%A _Jacques ALARDET_, Apr 03 2010
%E Edited by _N. J. A. Sloane_, Apr 05 2010