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 A325712 #4 May 16 2019 21:18:35
%S A325712 1,1,2,3,5,6,10,14,19,25,35,44,56,68,87,102,124,142,171,197,225,254,
%T A325712 294,326,370,408,451,505,553,604,661,726,772,854,916,989,1054,1151,
%U A325712 1199,1320,1376,1492,1555,1694,1736,1903,1952,2113,2170,2360,2387,2610
%N A325712 Number of separable partitions of n in which the number of distinct (repeatable) parts <= 3.
%C A325712 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.
%t A325712 (separable=Table[Map[#[[1]]&,Select[Map[{#,Quotient[(1+Length[#]),Max[Map[Length,Split[#]]]]}&,IntegerPartitions[nn]],#[[2]]>1&]],{nn,35}]);
%t A325712 Map[Length[Select[Map[{#,Length[Union[#]]}&,#],#[[2]]<=3&]]&,separable]
%t A325712 (* _Peter J. C. Moses_, May 08 2019 *)
%Y A325712 Cf. A000041, A325334.
%K A325712 nonn,easy
%O A325712 1,3
%A A325712 _Clark Kimberling_, May 16 2019