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 A325719 #4 May 20 2019 05:34:58
%S A325719 0,0,0,0,0,0,0,0,0,0,0,0,0,0,1,2,5,10,20,35,57,93,144,217,317,455,635,
%T A325719 890,1202,1623,2148,2837,3673,4768,6082,7740,9753,12262,15253,18972,
%U A325719 23373,28759,35143,42867,51998,62967,75865,91243,109315,130701,155752
%N A325719 Number of separable partitions of n in which the number of distinct (repeatable) parts is > 4.
%C A325719 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 A325719 a(n) = A325534(n) - A325713(n) for n >= 1.
%t A325719 (separable=Table[Map[#[[1]]&,Select[Map[{#,Quotient[(1+Length[#]),Max[Map[Length,Split[#]]]]}&,IntegerPartitions[nn]],#[[2]]>1&]],{nn,35}]);
%t A325719 Map[Length[Select[Map[{#,Length[Union[#]]}&,#],#[[2]]>4&]]&,separable]
%t A325719 (* _Peter J. C. Moses_, May 08 2019 *)
%Y A325719 Cf. A000041, A325534.
%K A325719 nonn,easy
%O A325719 1,16
%A A325719 _Clark Kimberling_, May 19 2019