A174984 - OEIS

The OEIS is supported by the many generous donors to the OEIS Foundation.

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”).

Other ways to Give

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

(list; graph; refs; listen; history; text; internal format)

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