login
The OEIS Foundation is supported by donations from users of the OEIS and by a grant from the Simons Foundation.

 

Logo


Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A325718 Number of separable partitions of n in which the number of distinct (repeatable) parts is > 3. 0
0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 2, 5, 10, 19, 29, 50, 74, 112, 158, 225, 311, 424, 564, 751, 979, 1273, 1638, 2082, 2640, 3323, 4159, 5171, 6419, 7895, 9707, 11872, 14481, 17573, 21319, 25709, 30997, 37205, 44619, 53304, 63646, 75698, 89998, 106664, 126306 (list; graph; refs; listen; history; text; internal format)
OFFSET

1,11

COMMENTS

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.

LINKS

Table of n, a(n) for n=1..49.

FORMULA

a(n) = A325534(n) - A325712(n) for n >= 1.

MATHEMATICA

(separable=Table[Map[#[[1]]&, Select[Map[{#, Quotient[(1+Length[#]), Max[Map[Length, Split[#]]]]}&, IntegerPartitions[nn]], #[[2]]>1&]], {nn, 35}]);

Map[Length[Select[Map[{#, Length[Union[#]]}&, #], #[[2]]>3&]]&, separable]

(* Peter J. C. Moses, May 08 2019 *)

CROSSREFS

Cf. A000041, A325534.

Sequence in context: A127297 A018739 A325648 * A011893 A132210 A000098

Adjacent sequences:  A325715 A325716 A325717 * A325719 A325720 A325721

KEYWORD

nonn,easy

AUTHOR

Clark Kimberling, May 17 2019

STATUS

approved

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Style Sheet | Transforms | Superseeker | Recent
The OEIS Community | Maintained by The OEIS Foundation Inc.

License Agreements, Terms of Use, Privacy Policy. .

Last modified March 6 20:37 EST 2021. Contains 341850 sequences. (Running on oeis4.)