The OEIS Foundation is supported by donations from users of the OEIS and by a grant from the Simons Foundation.

 Hints (Greetings from The On-Line Encyclopedia of Integer Sequences!)
 A328855 Number of factorizations of n into numbers with an odd number of distinct prime factors. 1
 1, 1, 1, 2, 1, 1, 1, 3, 2, 1, 1, 2, 1, 1, 1, 5, 1, 2, 1, 2, 1, 1, 1, 3, 2, 1, 3, 2, 1, 2, 1, 7, 1, 1, 1, 4, 1, 1, 1, 3, 1, 2, 1, 2, 2, 1, 1, 5, 2, 2, 1, 2, 1, 3, 1, 3, 1, 1, 1, 4, 1, 1, 2, 11, 1, 2, 1, 2, 1, 2, 1, 6, 1, 1, 2, 2, 1, 2, 1, 5, 5, 1, 1, 4, 1, 1, 1, 3, 1, 4 (list; graph; refs; listen; history; text; internal format)
 OFFSET 1,4 LINKS FORMULA Dirichlet g.f.: Product_{k>=1} 1 / (1 - A030230(k)^(-s)). EXAMPLE a(8) = 3 because 8 = 2 * 4 = 2 * 2 * 2. CROSSREFS Cf. A001055, A030230, A050330, A328856. Sequence in context: A295879 A322453 A327012 * A327658 A319786 A321271 Adjacent sequences:  A328852 A328853 A328854 * A328856 A328857 A328858 KEYWORD nonn AUTHOR Ilya Gutkovskiy, Oct 28 2019 STATUS approved

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Style Sheet | Transforms | Superseeker | Recent
The OEIS Community | Maintained by The OEIS Foundation Inc.

Last modified September 21 02:46 EDT 2020. Contains 337266 sequences. (Running on oeis4.)