A193582 Persistence of n for sort-and-subtract (A193581).

0, 1, 1, 1, 1, 1, 1, 1, 1, 1, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 3, 3, 3, 2, 2, 2

Offset

0,11

Comments

Number of sort-and-subtract steps to reach 0 when starting with n.

Links

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

Prog

(Haskell)
a193582 n = length $ takeWhile (> 0) $ iterate a193581 n
a193582_list = map a193582 [0..]

Crossrefs

Cf. A004185.

Sequence in context: A326307 A343639 A095827 * A091887 A144871 A066799

Adjacent sequences: A193579 A193580 A193581 * A193583 A193584 A193585

Keyword

nonn,base

Author

Reinhard Zumkeller, Aug 10 2011

Status

approved