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 A330994 #4 Jan 09 2020 18:13:17
%S A330994 1,1,2,3,5,7,11,3,11,15,21,14,77,101,135,176,231,297,385,245,627,198,
%T A330994 1002,1255,1575,979,812,1505,1859,4565,1401,3421,2783,1449,6155,4961,
%U A330994 17977,21637,26015,31185,1778,2123,26587,63261,75175,44567,17593,8911,49091
%N A330994 Numerator of P(n)/Q(n) = A000041(n)/A000009(n).
%C A330994 An integer partition of n is a finite, nonincreasing sequence of positive integers (parts) summing to n. It is strict if the parts are all different. Integer partitions and strict integer partitions are counted by A000041 and A000009 respectively.
%F A330994 A330994/A330995 = A000041/A000009.
%t A330994 Table[PartitionsP[n]/PartitionsQ[n],{n,0,100}]//Numerator
%Y A330994 The denominators are A330995.
%Y A330994 The rounded quotients are A330996.
%Y A330994 The same for factorizations is A331023.
%Y A330994 Cf. A000009, A000041, A003238, A005117, A035359, A046063, A331022.
%K A330994 nonn,frac
%O A330994 0,3
%A A330994 _Gus Wiseman_, Jan 08 2020