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 A325711 #5 May 16 2019 21:18:28
%S A325711 1,1,2,3,5,5,8,9,10,12,14,15,17,19,19,23,23,26,26,30,29,33,32,39,35,
%T A325711 40,39,45,41,50,44,53,49,54,51,64,53,61,59,70,59,74,62,75,71,75,68,91,
%U A325711 72,85,79,90,77,98,83,101,89,96,86,120
%N A325711 Number of separable partitions of n in which the number of distinct (repeatable) parts <= 2.
%C A325711 A partition is separable if there is an ordering of its parts in which no consecutive parts are identical. See A325534 for a guide to related sequences.
%e A325711 a(6) counts these 5 partitions: [6], [5,1], [4,2], [1,4,1], [2,1,2,1].
%t A325711 (separable=Table[Map[#[[1]]&,Select[Map[{#,Quotient[(1+Length[#]),Max[Map[Length,Split[#]]]]}&,IntegerPartitions[nn]],#[[2]]>1&]],{nn,35}]);
%t A325711 Map[Length[Select[Map[{#,Length[Union[#]]}&,#],#[[2]]<=2&]]&,separable]
%t A325711 (* _Peter J. C. Moses_, May 08 2019 *)
%Y A325711 Cf. A000041, A325334, A325712.
%K A325711 nonn,easy
%O A325711 1,3
%A A325711 _Clark Kimberling_, May 16 2019