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 A368037 #9 Mar 28 2025 07:59:38 %S A368037 1,2,3,4,7,8 %N A368037 Numbers k such that the number of strict partitions of k is the number of unrestricted partitions of some number. %C A368037 Are there others? See A072246. %e A368037 The 1 partition of 1 is [1]; the 1 strict partition of 1 is [1]. %e A368037 The 2 partitions of 2 are [2] and [1,1]; the 2 strict partitions of 3 are [3] and [2,1]. %e A368037 The 3 partitions of 3 are [3], [2,1], [1,1,1]; the 3 strict partitions of 5 are [5], [4,1], [3,2]. %e A368037 The 5 partitions of 4 are [4], [3,1], [2,2], [2,1,1], [1,1,1,1]; the 5 restricted partitions of 7 are [7], [6,1], [5,2], [4,3], [4,2,1]. %Y A368037 Cf. A072246, A368036. %K A368037 nonn %O A368037 1,2 %A A368037 _Clark Kimberling_, Dec 23 2023