A018194 - OEIS

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

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

OFFSET

1,6

REFERENCES

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

LINKS

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

FORMULA

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

PROG

(Haskell)

a018194 n = 1 + length (takeWhile (/= 0) $ zipWith (-) ks $ tail ks)