%I A086436
%S A086436 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,
%T A086436 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,
%U A086436 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 A086436 Maximum number of parts possible in a factorization of n.
%H A086436 Eric Weisstein's World of Mathematics, <a href="http://mathworld.wolfram.com/
               UnorderedFactorization.html">Unordered Factorization</a>
%e A086436 a(6)=2 since 6 may be factored as {{2,3},{6}}, so the largest number 
               of factors possible is 2.
%e A086436 a(8)=3 since 8 may be factored as {{8},{2,2,2},{2,4}}, so the largest 
               numbers of factors possible is 3.
%o A086436 (Mupad) numlib::Omega (n)$ n=1..102 - Zerinvary Lajos (zerinvarylajos(AT)yahoo.com), 
               May 13 2008
%Y A086436 Essentially the same as A001222.
%Y A086436 Sequence in context: A125030 A116479 A122810 this_sequence A001222 A098893 
               A069248
%Y A086436 Adjacent sequences: A086433 A086434 A086435 this_sequence A086437 A086438 
               A086439
%K A086436 nonn
%O A086436 1,4
%A A086436 Eric Weisstein (eric(AT)weisstein.com), Jul 19, 2003