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

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, 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, 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

Offset

1,1

Links

Table of n, a(n) for n=1..100.

Example

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

Crossrefs

Cf. A167507, A174985.

Sequence in context: A071992 A291845 A322193 * A092141 A120867 A011427

Adjacent sequences: A174981 A174982 A174983 * A174985 A174986 A174987

Keyword

nonn,word

Author

Jacques ALARDET, Apr 03 2010

Extensions

Edited by N. J. A. Sloane, Apr 05 2010

Status

approved