A200747 Number of iterations of A034968 required to reach 1.

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

Offset: 1

Author

Franklin T. Adams-Watters, Nov 27 2011

Keywords

• nonn

Comments

a(n) = 1 when n is a factorial > 1.

Links

• Alois P. Heinz, Table of n, a(n) for n = 1..10000

Crossrefs

Cf. A034968.

Programs

PARI

a(n)=local(r);while(n>1,n=A034968(n);r++);r