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 A325718 #4 May 19 2019 20:34:48
%S A325718 0,0,0,0,0,0,0,0,0,1,2,5,10,19,29,50,74,112,158,225,311,424,564,751,
%T A325718 979,1273,1638,2082,2640,3323,4159,5171,6419,7895,9707,11872,14481,
%U A325718 17573,21319,25709,30997,37205,44619,53304,63646,75698,89998,106664,126306
%N A325718 Number of separable partitions of n in which the number of distinct (repeatable) parts is > 3.
%C A325718 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 A325718 a(n) = A325534(n) - A325712(n) for n >= 1.
%t A325718 (separable=Table[Map[#[[1]]&,Select[Map[{#,Quotient[(1+Length[#]),Max[Map[Length,Split[#]]]]}&,IntegerPartitions[nn]],#[[2]]>1&]],{nn,35}]);
%t A325718 Map[Length[Select[Map[{#,Length[Union[#]]}&,#],#[[2]]>3&]]&,separable]
%t A325718 (* _Peter J. C. Moses_, May 08 2019 *)
%Y A325718 Cf. A000041, A325534.
%K A325718 nonn,easy
%O A325718 1,11
%A A325718 _Clark Kimberling_, May 17 2019