id:A108602 - OEIS Search Results

Search: id:A108602

Displaying 1-1 of 1 results found.

page 1

Number of distinct prime factors of highly composite numbers (definition 1, A002182).

+0
6

0, 1, 1, 2, 2, 2, 2, 2, 3, 3, 3, 3, 3, 3, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 5, 4, 4, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 7, 6, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 8, 7, 7, 8, 8, 7, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 9, 8, 9, 8, 9, 8, 9, 9, 8, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9 (list; graph; listen)

	OFFSET	`1,4`
	COMMENT	`n appears A086334(n) times. - Lekraj Beedassy (blekraj(AT)yahoo.com), Sep 02 2006`
	LINKS	`T. D. Noe, Table of n, a(n) for n=1..10000 (using data from Flammenkamp)`
	FORMULA	`a(n) = A001221(A002182(n)).`
	EXAMPLE	`A002182(8) = 48 = 2^4*3, which has 2 distinct prime factors, so a(8)=2.`
	CROSSREFS	`Cf. A002182, A002183.` `Sequence in context: A000196 A111850 A059396 this_sequence A085290 A108611 A133875` `Adjacent sequences: A108599 A108600 A108601 this_sequence A108603 A108604 A108605`
	KEYWORD	`nonn`
	AUTHOR	`Jud McCranie (j.mccranie(AT)comcast.net), Jun 12 2005`
	EXTENSIONS	`Edited by Ray Chandler (rayjchandler(AT)sbcglobal.net), Nov 11 2005`

page 1

Search completed in 0.002 seconds

Last modified December 18 21:37 EST 2009. Contains 171024 sequences.

AT&T Labs Research