id:A111972 - OEIS Search Results

Search: id:A111972

Displaying 1-1 of 1 results found.

page 1

A111972

Max(omega(k): 1<=k<=n), where omega(n)=A001221(n), the number of distinct prime factors of n.

+0
1

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; listen)

	OFFSET	`1,6`
	COMMENT	`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: A111893 A121902 A087103 this_sequence A073458 A105519 A111891` `Adjacent sequences: A111969 A111970 A111971 this_sequence A111973 A111974 A111975`
	KEYWORD	`nonn`
	AUTHOR	`Rick L. Shepherd (rshepherd2(AT)hotmail.com), Aug 24 2005`

page 1

Search completed in 0.002 seconds

Last modified December 7 08:40 EST 2009. Contains 170430 sequences.

AT&T Labs Research