|
| |
|
|
A073855
|
|
Number of steps to reach 0 starting with n and applying the process x ->bigomega(x).
|
|
1
| |
|
|
1, 2, 2, 3, 2, 3, 2, 3, 3, 3, 2, 3, 2, 3, 3, 4, 2, 3, 2, 3, 3, 3, 2, 4, 3, 3, 3, 3, 2, 3, 2, 3, 3, 3, 3, 4, 2, 3, 3, 4, 2, 3, 2, 3, 3, 3, 2, 3, 3, 3, 3, 3, 2, 4, 3, 4, 3, 3, 2, 4, 2, 3, 3, 4, 3, 3, 2, 3, 3, 3, 2, 3, 2, 3, 3, 3, 3, 3, 2, 3, 4, 3, 2, 4, 3, 3, 3, 4, 2, 4, 3, 3, 3, 3, 3, 4, 2, 3, 3, 4, 2, 3, 2, 4, 3
(list; graph; refs; listen; history; internal format)
|
|
|
|
OFFSET
| 1,2
|
|
|
FORMULA
| a(n)=1+a(bigomega(n)). - Vladeta Jovovic (vladeta(AT)eunet.rs), Jul 10 2004
|
|
|
EXAMPLE
| bigomega(36) = 4, bigomega(4) = 2, bigomega(2) = 1, bigomega(1) = 0, hence a(36) = 4.
|
|
|
MAPLE
| a(n)=if(n<0, 0, s=n; c=1; while(bigomega(s)>0, s=bigomega(s); c++); c)
|
|
|
CROSSREFS
| A036430(n) + 1.
Sequence in context: A049237 A162361 A171135 * A077982 A185816 A099427
Adjacent sequences: A073852 A073853 A073854 * A073856 A073857 A073858
|
|
|
KEYWORD
| easy,nonn
|
|
|
AUTHOR
| Benoit Cloitre (benoit7848c(AT)orange.fr), Sep 02 2002
|
|
|
EXTENSIONS
| More terms from Vladeta Jovovic (vladeta(AT)eunet.rs), Jul 10 2004
|
| |
|
|
