The OEIS is supported by the many generous donors to the OEIS Foundation.

 Hints (Greetings from The On-Line Encyclopedia of Integer Sequences!)
 A300983 Number of partitions of n into distinct parts having the same number of prime divisors (counted with multiplicity) as n. 7
 1, 1, 1, 1, 1, 2, 1, 2, 1, 1, 2, 1, 1, 2, 2, 2, 1, 2, 1, 3, 2, 2, 1, 5, 1, 5, 2, 1, 2, 7, 2, 9, 1, 4, 6, 9, 1, 11, 6, 10, 2, 14, 2, 15, 1, 2, 12, 19, 1, 18, 5, 16, 2, 26, 1, 24, 2, 23, 26, 35, 2, 39, 31, 3, 1, 40, 4, 50, 6, 49, 9, 61, 1, 67, 68, 7, 6, 70, 10, 87, 2, 1, 93, 102, 2, 107 (list; graph; refs; listen; history; text; internal format)
 OFFSET 0,6 LINKS Alois P. Heinz, Table of n, a(n) for n = 0..1000 Index entries for sequences related to partitions FORMULA a(n) = [x^n] Product_{bigomega(k) = bigomega(n)} (1 + x^k). EXAMPLE a(20) = 2 because we have [20] and [12, 8], where 20, 12 and 8 are numbers that are the product of exactly 3 (not necessarily distinct) primes. MAPLE with(numtheory): a:= proc(m) option remember; local k, b; k, b:= bigomega(m), proc(n, i) option remember; `if`(i*(i+1)/2

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

Last modified November 28 09:23 EST 2023. Contains 367412 sequences. (Running on oeis4.)