This is a front-end for the Online Encyclopedia of Integer Sequences, made by Christian Perfect. The idea is to provide OEIS entries in non-ancient HTML, and then to think about how they're presented visually. The source code is on GitHub.
%I A358909 #6 Dec 10 2022 10:47:38
%S A358909 1,1,2,3,5,7,11,15,22,29,41,53,73,93,124,157,206,256,329,406,514,628,
%T A358909 784,949,1174,1411,1725,2061,2500,2966,3570,4217,5039,5919,7027,8219,
%U A358909 9706,11301,13268,15394,17995,20792,24195,27863,32288,37061,42779,48950,56306
%N A358909 Number of integer partitions of n whose parts have weakly decreasing numbers of prime factors (A001222).
%C A358909 First differs from A000041 at a(9) = 29, A000041(9) = 30, the difference coming from the partition (5,4).
%t A358909 Table[Length[Select[IntegerPartitions[n],GreaterEqual@@PrimeOmega/@#&]],{n,0,30}]
%Y A358909 For sequences of partitions see A141199, compositions A218482.
%Y A358909 The case of equality is A319169, for compositions A358911.
%Y A358909 The case of compositions is A358335, strictly decreasing A358901.
%Y A358909 The complement is counted by A358910.
%Y A358909 A001222 counts prime factors, distinct A001221.
%Y A358909 A011782 counts compositions.
%Y A358909 A063834 counts twice-partitions.
%Y A358909 Cf. A056239, A300335, A320324, A358831, A358903, A358908.
%K A358909 nonn
%O A358909 0,3
%A A358909 _Gus Wiseman_, Dec 09 2022