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 A325720 #4 May 20 2019 05:35:06
%S A325720 0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,1,2,5,10,20,36,64,101,166,
%T A325720 254,388,568,830,1169,1645,2270,3096,4161,5556,7312,9572,12402,15962,
%U A325720 20386,25851,32595,40850,50938,63148,77979,95773,117231,142777,173387
%N A325720 Number of separable partitions of n in which the number of distinct (repeatable) parts is > 5.
%C A325720 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 A325720 a(n) = A325534(n) - A325714(n) for n >= 1.
%t A325720 (separable=Table[Map[#[[1]]&,Select[Map[{#,Quotient[(1+Length[#]),Max[Map[Length,Split[#]]]]}&,IntegerPartitions[nn]],#[[2]]>1&]],{nn,35}]);
%t A325720 Map[Length[Select[Map[{#,Length[Union[#]]}&,#],#[[2]]>5&]]&,separable]
%t A325720 (* _Peter J. C. Moses_, May 08 2019 *)
%Y A325720 Cf. A000041, A325534.
%K A325720 nonn,easy
%O A325720 1,22
%A A325720 _Clark Kimberling_, May 19 2019