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 A320226 #7 Nov 04 2019 19:33:47
%S A320226 1,1,2,3,5,6,9,10,13,15,18,19,24,25,28,31,35,36,41,42,47,50,53,54,61,
%T A320226 63,66,69,74,75,82,83,88,91,94,97,105,106,109,112,119,120,127,128,133,
%U A320226 138,141,142,151,153,158,161,166,167,174,177,184,187,190,191,202
%N A320226 Number of integer partitions of n whose non-1 parts are all equal.
%H A320226 Jonathan Bloom, Nathan McNew, <a href="https://arxiv.org/abs/1908.03953">Counting pattern-avoiding integer partitions</a>, arXiv:1908.03953 [math.CO], 2019.
%F A320226 a(n > 1) = A002541(n - 1) + 1.
%e A320226 The integer partitions whose non-1 parts are all equal:
%e A320226 (1) (2) (3) (4) (5) (6) (7) (8)
%e A320226 (11) (21) (22) (41) (33) (61) (44)
%e A320226 (111) (31) (221) (51) (331) (71)
%e A320226 (211) (311) (222) (511) (611)
%e A320226 (1111) (2111) (411) (2221) (2222)
%e A320226 (11111) (2211) (4111) (3311)
%e A320226 (3111) (22111) (5111)
%e A320226 (21111) (31111) (22211)
%e A320226 (111111) (211111) (41111)
%e A320226 (1111111) (221111)
%e A320226 (311111)
%e A320226 (2111111)
%e A320226 (11111111)
%t A320226 Table[Length[Select[IntegerPartitions[n],SameQ@@DeleteCases[#,1]&]],{n,30}]
%Y A320226 Cf. A002541, A003238, A070776, A126656, A316782, A317712, A320224, A320225.
%K A320226 nonn
%O A320226 0,3
%A A320226 _Gus Wiseman_, Oct 07 2018