|
%I #45 Dec 17 2017 14:26:44
%S 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,
%T 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,
%U 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
%N Maximum number of parts possible in a factorization of n; a(1) = 1, and for n > 1, a(n) = A001222(n) = bigomega(n).
%C Incorrect (a(1)=0, not 1 as given here) duplicate of A001222. - _Joerg Arndt_, Jul 22 2017
%H Antti Karttunen, <a href="/A086436/b086436.txt">Table of n, a(n) for n = 1..1024</a>
%H Eric Weisstein's World of Mathematics, <a href="http://mathworld.wolfram.com/UnorderedFactorization.html">Unordered Factorization</a>
%e a(6)=2 since 6 may be factored as {{2,3},{6}}, so the largest number of factors possible is 2 {2,3}.
%e a(8)=3 since 8 may be factored as {{8},{2,2,2},{2,4}}, so the largest numbers of factors possible is 3 {2,2,2}.
%e a(30)=3 since 30 may be factored as {{30},{2,3,5},{5,6},{3,10},{2,15}}, so the largest numbers of factors possible is 3 {2,3,5}.
%t Join[{1},PrimeOmega[Range[2,110]]] (* _Harvey P. Dale_, Jun 20 2013 *)
%o (MuPAD) numlib::Omega (n)$ n=1..102 // _Zerinvary Lajos_, May 13 2008
%Y Essentially the same as A001222.
%K nonn
%O 1,4
%A _Eric W. Weisstein_, Jul 19 2003
%E Alternative description added to the name by _Antti Karttunen_, Oct 21 2017
|
