A036430 Number of iterations needed to reach 1 under the map n -> Omega(n).

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

Offset

1,4

Links

Charles R Greathouse IV, Table of n, a(n) for n = 1..10000

Formula

a(n) = a(bigomega(n)) + 1 for n > 1. - Vladeta Jovovic, Jul 10 2004

a(n) = O(log* n). - Charles R Greathouse IV, Apr 25 2012

Example

16 -> 4 -> 2 -> 1 and thus a(16) = 3.

Prog

(PARI) a(n)=my(s); while(n>1, n=bigomega(n); s++); s \\ Charles R Greathouse IV, Apr 25 2012

Crossrefs

Cf. A029908, A073855.

Sequence in context: A051034 A024935 A082477 * A323305 A322794 A163377

Adjacent sequences: A036427 A036428 A036429 * A036431 A036432 A036433

Keyword

nonn,easy

Author

Dann Toliver

Extensions

Corrected and extended by Antonio G. Astudillo (afg_astudillo(AT)lycos.com), Apr 21 2003

Formula corrected by Charles R Greathouse IV, Apr 25 2012

Status

approved