The OEIS Foundation is supported by donations from users of the OEIS and by a grant from the Simons Foundation.

 Hints (Greetings from The On-Line Encyclopedia of Integer Sequences!)
 A261923 Number of steps to reach 0, starting at n, and iteration the map x -> A261922(x). 3
 0, 1, 2, 1, 2, 2, 3, 1, 2, 2, 2, 3, 3, 3, 3, 1, 2, 2, 2, 3, 2, 2, 3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 2, 2, 2, 3, 2, 2, 3, 3, 2, 2, 2, 3, 2, 3, 3, 3, 3, 3, 3, 3, 2, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 2, 2, 2, 3, 2, 2, 3, 3, 2, 2, 2, 4, 3, 2, 3, 3, 2, 2, 2, 4, 2, 2 (list; graph; refs; listen; history; text; internal format)
 OFFSET 0,3 COMMENTS a(A262279(n)) = n. - Reinhard Zumkeller, Sep 17 2015 LINKS Reinhard Zumkeller, Table of n, a(n) for n = 0..10000 EXAMPLE 13 -> 4 -> 3 -> 0, which takes 3 steps to reach 0, so a(13)=3. PROG (Haskell) a261923 n = fst \$ until ((== 0) . snd)                         (\(step, x) -> (step + 1, a261922 x)) (0, n) -- Reinhard Zumkeller, Sep 17 2015 CROSSREFS Cf. A261922, A261461. Cf. A262279. Sequence in context: A086342 A274036 A194449 * A124736 A144016 A179868 Adjacent sequences:  A261920 A261921 A261922 * A261924 A261925 A261926 KEYWORD nonn AUTHOR N. J. A. Sloane, Sep 17 2015 STATUS approved

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Style Sheet | Transforms | Superseeker | Recent
The OEIS Community | Maintained by The OEIS Foundation Inc.

Last modified June 16 21:55 EDT 2021. Contains 345080 sequences. (Running on oeis4.)