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 A325646 #8 May 16 2019 17:34:03
%S A325646 0,0,1,2,4,4,7,8,9,11,13,14,16,18,18,22,22,25,25,29,28,32,31,38,34,39,
%T A325646 38,44,40,49,43,52,48,53,50,63,52,60,58,69,58,73,61,74,70,74,67,90,71,
%U A325646 84,78,89,76,97,82,100,88,95,85,119
%N A325646 Number of separable partitions of n in which the number of distinct (repeatable) parts is 2.
%C A325646 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 A325646 a(6) counts these 4 partitions: [5,1], [4,2], [1,4,1], [2,1,2,1].
%t A325646 (separable=Table[Map[# [[1]]&,Select[Map[{#,Quotient[(1+Length[#]),Max[Map[Length,Split[#]]]]}&,IntegerPartitions[nn]],#[[2]]>1&]],{nn,35}]);
%t A325646 Map[Length[Select[Map[{#,Length[Union[#]]}&,#],#[[2]]==2&]]&,separable]
%t A325646 (* _Peter J. C. Moses_, May 08 2019 *)
%Y A325646 Cf. A000041, A325334, A325647.
%K A325646 nonn,easy
%O A325646 1,4
%A A325646 _Clark Kimberling_, May 16 2019