|
| |
|
|
A111972
|
|
Max(omega(k): 1<=k<=n), where omega(n)=A001221(n), the number of distinct prime factors of n.
|
|
0
| |
|
|
0, 1, 1, 1, 1, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3
(list; graph; refs; listen; history; internal format)
|
|
|
|
OFFSET
| 1,6
|
|
|
COMMENTS
| This sequence has the same relationship to A001221 as A000523 has to A001222. Also, for n>=1, n-1 occurs as A002110(n)-A002110(n-1) consecutive terms beginning with term a(A002110(n-1)), where A002110 is the primorials; i.e. the frequencies of occurrence are the first differences (1,4,24,180,...) of the primorials.
|
|
|
EXAMPLE
| a(7)=2 because omega(1)=0, omega(2)=omega(3)=omega(4)=omega(5)=omega(7)=1 and omega(6)=2 (as 6=2*3), so 2 is the maximum.
|
|
|
CROSSREFS
| Cf. A001221 (omega(n)), A002110 (primorials), A000523 (Log_2(n) rounded down), A001222 (Omega(n), also known as bigomega(n)).
Sequence in context: A121902 A087103 A204551 * A073458 A194698 A105519
Adjacent sequences: A111969 A111970 A111971 * A111973 A111974 A111975
|
|
|
KEYWORD
| nonn
|
|
|
AUTHOR
| Rick L. Shepherd (rshepherd2(AT)hotmail.com), Aug 24 2005
|
| |
|
|
