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

Author

Henry Ibstedt (Glimminge 2036, 28060 Broby, Sweden)

Keywords

• nonn

References

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

Links

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

Crossrefs

Cf. A002034, A046022.

Programs

Haskell

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

Formula

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

Extensions

Corrected and extended by David W. Wilson, May 15 1997