A193582 - OEIS

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

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

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