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 A325717 #4 May 19 2019 20:34:42
%S A325717 0,0,0,0,0,1,2,5,9,14,23,34,49,68,97,129,175,228,303,392,507,645,826,
%T A325717 1038,1314,1641,2050,2542,3152,3877,4776,5844,7142,8695,10572,12797,
%U A325717 15482,18663,22459,26959,32314,38623,46112,54923,65311,77526,91882,108686
%N A325717 Number of separable partitions of n in which the number of distinct (repeatable) parts is > 2.
%C A325717 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.
%F A325717 a(n) = A325534(n) - A325711(n) for n >= 1.
%t A325717 (separable=Table[Map[#[[1]]&,Select[Map[{#,Quotient[(1+Length[#]),Max[Map[Length,Split[#]]]]}&,IntegerPartitions[nn]],#[[2]]>1&]],{nn,35}]);
%t A325717 Map[Length[Select[Map[{#,Length[Union[#]]}&,#],#[[2]]>2&]]&,separable]
%t A325717 (* _Peter J. C. Moses_, May 08 2019 *)
%Y A325717 Cf. A000041, A325534.
%K A325717 nonn,easy
%O A325717 1,7
%A A325717 _Clark Kimberling_, May 17 2019