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 A330995 #4 Jan 09 2020 18:13:39
%S A330995 1,1,1,2,2,3,4,1,3,4,5,3,15,18,22,27,32,38,46,27,64,19,89,104,122,71,
%T A330995 55,96,111,256,74,170,130,64,256,195,668,760,864,982,53,60,713,1610,
%U A330995 1816,1024,384,185,970,3264,1829,4097,4582,5120,5718,3189,7108,2639
%N A330995 Denominator P(n)/Q(n) = A000041(n)/A000009(n).
%C A330995 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.
%C A330995 Conjecture: The only 1's occur at n = 0, 1, 2, 7.
%F A330995 A330994/A330995 = A000041/A000009.
%t A330995 Table[PartitionsP[n]/PartitionsQ[n],{n,0,100}]//Denominator
%Y A330995 The numerators are A330994.
%Y A330995 The rounded quotients are A330996.
%Y A330995 The same for factorizations is A331024.
%Y A330995 Cf. A000009, A000041, A001055, A003238, A005117, A035359, A045778, A046063, A331022.
%K A330995 nonn,frac
%O A330995 0,4
%A A330995 _Gus Wiseman_, Jan 08 2020