login
Start with n, iterate the map k -> A167507(k) until we reach 3; a(n) = number of steps required.
2

%I #8 Apr 25 2020 03:03:03

%S 4,5,4,1,3,4,2,4,4,4,4,5,4,1,3,4,2,4,4,4,4,5,4,1,3,4,2,4,4,4,4,5,4,1,

%T 3,4,2,4,4,4,4,5,4,1,3,4,2,4,4,4,4,5,4,1,3,4,2,4,4,4,4,5,4,1,3,4,2,4,

%U 4,4,4,5,4,1,3,4,2,4,4,4,4,5,4,1,3,4,2,4,4,4,4,5,4,1,3,4,2,4,4,4

%N Start with n, iterate the map k -> A167507(k) until we reach 3; a(n) = number of steps required.

%e a(0): zero => 4 => quatre => 6 => six => 3 ==> length = 4. a(1): un => 2 => deux => 4 => quatre => 6 => six => 3 ==> length = 5.

%Y Cf. A167507, A174985.

%K nonn,word

%O 1,1

%A _Jacques ALARDET_, Apr 03 2010

%E Edited by _N. J. A. Sloane_, Apr 05 2010