login

Year-end appeal: Please make a donation to the OEIS Foundation to support ongoing development and maintenance of the OEIS. We are now in our 61st year, we have over 378,000 sequences, and we’ve reached 11,000 citations (which often say “discovered thanks to the OEIS”).

A358335
Number of integer compositions of n whose parts have weakly decreasing numbers of prime factors (with multiplicity).
6
1, 1, 2, 3, 5, 8, 12, 19, 29, 44, 68, 100, 153, 227, 342, 509, 759, 1129, 1678, 2492, 3699, 5477, 8121, 12015, 17795, 26313, 38924, 57541, 85065, 125712, 185758, 274431, 405420, 598815, 884465, 1306165, 1928943, 2848360, 4205979, 6210289, 9169540
OFFSET
0,3
LINKS
Alois P. Heinz, Table of n, a(n) for n = 0..2000 (first 101 terms from Lucas A. Brown)
Lucas A. Brown, Python program.
EXAMPLE
The a(0) = 1 through a(6) = 12 compositions:
() (1) (2) (3) (4) (5) (6)
(11) (21) (22) (23) (33)
(111) (31) (32) (42)
(211) (41) (51)
(1111) (221) (222)
(311) (231)
(2111) (321)
(11111) (411)
(2211)
(3111)
(21111)
(111111)
MATHEMATICA
Table[Length[Select[Join @@ Permutations/@IntegerPartitions[n], GreaterEqual@@PrimeOmega/@#&]], {n, 0, 10}]
CROSSREFS
For lengths of partitions see A141199, compositions A218482.
The strictly decreasing case is A358901.
The version not counting multiplicity is A358902, strict A358903.
The case of partitions is A358909, complement A358910.
The case of equality is A358911, partitions A319169.
A001222 counts prime factors, distinct A001221.
A011782 counts compositions.
A063834 counts twice-partitions.
Sequence in context: A124062 A274199 A099823 * A240523 A023436 A024567
KEYWORD
nonn
AUTHOR
Gus Wiseman, Dec 05 2022
EXTENSIONS
a(21) and beyond from Lucas A. Brown, Dec 15 2022
STATUS
approved