id:A086436 - OEIS Search Results

Search: id:A086436

Displaying 1-1 of 1 results found.

page 1

Maximum number of parts possible in a factorization of n.

+0
6

1, 1, 1, 2, 1, 2, 1, 3, 2, 2, 1, 3, 1, 2, 2, 4, 1, 3, 1, 3, 2, 2, 1, 4, 2, 2, 3, 3, 1, 3, 1, 5, 2, 2, 2, 4, 1, 2, 2, 4, 1, 3, 1, 3, 3, 2, 1, 5, 2, 3, 2, 3, 1, 4, 2, 4, 2, 2, 1, 4, 1, 2, 3, 6, 2, 3, 1, 3, 2, 3, 1, 5, 1, 2, 3, 3, 2, 3, 1, 5, 4, 2, 1, 4, 2, 2, 2, 4, 1, 4, 2, 3, 2, 2, 2, 6, 1, 3, 3, 4, 1, 3 (list; graph; listen)

	OFFSET	`1,4`
	LINKS	`Eric Weisstein's World of Mathematics, Unordered Factorization`
	EXAMPLE	`a(6)=2 since 6 may be factored as {{2,3},{6}}, so the largest number of factors possible is 2.` `a(8)=3 since 8 may be factored as {{8},{2,2,2},{2,4}}, so the largest numbers of factors possible is 3.`
	PROGRAM	`(Mupad) numlib::Omega (n)$ n=1..102 - Zerinvary Lajos (zerinvarylajos(AT)yahoo.com), May 13 2008`
	CROSSREFS	`Essentially the same as A001222.` `Sequence in context: A125030 A116479 A122810 this_sequence A001222 A098893 A069248` `Adjacent sequences: A086433 A086434 A086435 this_sequence A086437 A086438 A086439`
	KEYWORD	`nonn`
	AUTHOR	`Eric Weisstein (eric(AT)weisstein.com), Jul 19, 2003`

page 1

Search completed in 0.002 seconds

Last modified November 25 20:09 EST 2009. Contains 167514 sequences.

AT&T Labs Research