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

 

Logo


Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A018194 Number of steps for S(S(..S(n)..)) to converge, where S is the Kempner function A002034. 5

%I

%S 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,

%T 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,

%U 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

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

%C a(A046022(n)) = 1. [_Reinhard Zumkeller_, Mar 09 2012]

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

%H Reinhard Zumkeller, <a href="/A018194/b018194.txt">Table of n, a(n) for n = 1..10000</a>

%o (Haskell)

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

%o where ks = iterate a002034 n

%o -- _Reinhard Zumkeller_, Mar 09 2012

%Y Cf. A002034.

%K nonn

%O 1,6

%A Henry Ibstedt (Glimminge 2036, 28060 Broby, Sweden)

%E Corrected and extended by _David W. Wilson_ May 15 1997

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.

License Agreements, Terms of Use, Privacy Policy. .

Last modified June 15 08:52 EDT 2021. Contains 345048 sequences. (Running on oeis4.)