A018194 Number of steps for S(S(..S(n)..)) to converge, where S is the Kempner function A002034.

1, 1, 1, 1, 1, 2, 1, 2, 3, 2, 1, 2, 1, 2, 2, 3, 1, 3, 1, 2, 2, 2, 1, 2, 3, 2, 4, 2, 1, 2, 1, 3, 2, 2, 2, 3, 1, 2, 2, 2, 1, 2, 1, 2, 3, 2, 1, 3, 3, 3, 2, 2, 1, 4, 2, 2, 2, 2, 1, 2, 1, 2, 2, 3, 2, 2, 1, 2, 2, 2, 1, 3, 1, 2, 3, 2, 2, 2, 1, 3, 4, 2, 1, 2, 2, 2, 2, 2, 1, 3, 2, 2, 2, 2, 2, 3, 1, 3, 2, 3, 1, 2, 1, 2, 2, 2, 1, 4

Offset

1,6

Comments

a(A046022(n)) = 1. [Reinhard Zumkeller, Mar 09 2012]

References

Henry Ibstedt, "Smarandache Iterations", Smarandache Notions Journal, (submitted), 1996.

Links

Reinhard Zumkeller, Table of n, a(n) for n = 1..10000

Prog

(Haskell)
a018194 n = 1 + length (takeWhile (/= 0) $ zipWith (-) ks $ tail ks)
   where ks = iterate a002034 n
-- Reinhard Zumkeller, Mar 09 2012

Crossrefs

Cf. A002034.

Sequence in context: A361158 A329744 A277889 * A338630 A286281 A229830

Adjacent sequences: A018191 A018192 A018193 * A018195 A018196 A018197

Keyword

nonn

Author

Henry Ibstedt (Glimminge 2036, 28060 Broby, Sweden)

Extensions

Corrected and extended by David W. Wilson May 15 1997

Status

approved