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 A325715 #4 May 19 2019 20:34:29
%S A325715 1,1,2,3,5,6,10,14,19,26,37,49,66,87,116,152,198,254,329,422,536,678,
%T A325715 858,1077,1349,1681,2089,2586,3191,3922,4810,5877,7155,8684,10514,
%U A325715 12686,15256,18294,21869,26068,30974,36700,43355,51085,59984,70280,82081,95647
%N A325715 Number of separable partitions of n in which the number of distinct (repeatable) parts <= 6.
%C A325715 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 A325715 (separable=Table[Map[#[[1]]&,Select[Map[{#,Quotient[(1+Length[#]),Max[Map[Length,Split[#]]]]}&,IntegerPartitions[nn]],#[[2]]>1&]],{nn,35}]);
%t A325715 Map[Length[Select[Map[{#,Length[Union[#]]}&,#],#[[2]]<=6&]]&,separable]
%t A325715 (* _Peter J. C. Moses_, May 08 2019 *)
%Y A325715 Cf. A000041, A325334.
%K A325715 nonn,easy
%O A325715 1,3
%A A325715 _Clark Kimberling_, May 17 2019