|
|
A073855
|
|
Number of steps to reach 0 starting with n and applying the process x ->bigomega(x), where bigomega = A001222.
|
|
3
|
|
|
0, 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;
text;
internal format)
|
|
|
OFFSET
|
0,3
|
|
LINKS
|
|
|
FORMULA
|
With a(0) = 0 as the termination condition of the recurrence. - Antti Karttunen, Jul 28 2017
|
|
EXAMPLE
|
bigomega(36) = 4, bigomega(4) = 2, bigomega(2) = 1, bigomega(1) = 0, hence a(36) = 4.
|
|
MAPLE
|
option remember;
if n <=0 then
0;
else
1+procname(numtheory[bigomega](n)) ;
end if;
end proc:
|
|
MATHEMATICA
|
Table[-1 + Length@ NestWhileList[PrimeOmega, n, # > 0 &], {n, 0, 105}] (* Michael De Vlieger, Jul 29 2017 *)
|
|
PROG
|
(PARI) a(n)=if(n<=0, 0, s=n; c=1; while(bigomega(s)>0, s=bigomega(s); c++); c)
(PARI) first(n) = my(v = vector(n-1)); v[1] = 1; for(i=2, #v, v[i] = 1 + v[bigomega(i)]); concat([0], v) \\ David A. Corneth, Jul 28 2017
|
|
CROSSREFS
|
|
|
KEYWORD
|
easy,nonn
|
|
AUTHOR
|
|
|
EXTENSIONS
|
|
|
STATUS
|
approved
|
|
|
|