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 A325714 #4 May 16 2019 21:18:53
%S A325714 1,1,2,3,5,6,10,14,19,26,37,49,66,87,116,152,198,254,329,422,535,676,
%T A325714 853,1067,1329,1645,2025,2486,3027,3673,4432,5329,6361,7580,8978,
%U A325714 10591,12439,14563,16962,19717,22801,26295,30212,34612,39531,45006,51100,57839
%N A325714 Number of separable partitions of n in which the number of distinct (repeatable) parts <= 5.
%C A325714 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 A325714 (separable=Table[Map[#[[1]]&,Select[Map[{#,Quotient[(1+Length[#]),Max[Map[Length,Split[#]]]]}&,IntegerPartitions[nn]],#[[2]]>1&]],{nn,35}]);
%t A325714 Map[Length[Select[Map[{#,Length[Union[#]]}&,#],#[[2]]<=5&]]&,separable]
%t A325714 (* _Peter J. C. Moses_, May 08 2019 *)
%Y A325714 Cf. A000041, A325334.
%K A325714 nonn,easy
%O A325714 1,3
%A A325714 _Clark Kimberling_, May 16 2019