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 A325713 #4 May 16 2019 21:18:43
%S A325713 1,1,2,3,5,6,10,14,19,26,37,49,66,87,115,150,193,244,309,387,479,585,
%T A325713 714,860,1032,1226,1454,1697,1991,2304,2672,3060,3518,3981,4541,5121,
%U A325713 5782,6462,7265,8057,9000,9938,11031,12131,13384,14634,16085,17534,19161
%N A325713 Number of separable partitions of n in which the number of distinct (repeatable) parts <= 4.
%C A325713 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 A325713 (separable=Table[Map[#[[1]]&,Select[Map[{#,Quotient[(1+Length[#]),Max[Map[Length,Split[#]]]]}&,IntegerPartitions[nn]],#[[2]]>1&]],{nn,35}]);
%t A325713 Map[Length[Select[Map[{#,Length[Union[#]]}&,#],#[[2]]<=4&]]&,separable]
%t A325713 (* _Peter J. C. Moses_, May 08 2019 *)
%Y A325713 Cf. A000041, A325334.
%K A325713 nonn,easy
%O A325713 1,3
%A A325713 _Clark Kimberling_, May 16 2019