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

 Hints (Greetings from The On-Line Encyclopedia of Integer Sequences!)
 A327698 Number of refinement sequences n -> ... -> {1}^n, where in each step exactly one part is replaced by a partition of itself into smaller parts (in weakly decreasing order). 4
 1, 1, 2, 6, 17, 74, 300, 1755, 9360, 65510, 442117, 3802889, 30213386, 294892947, 2789021105, 31360525517, 334374848070, 4184958056248, 50606351991305, 704124800141153, 9452367941048830, 143309007303310536, 2124982437997726705, 35389562541842450218 (list; graph; refs; listen; history; text; internal format)
 OFFSET 1,3 LINKS Wikipedia, Partition (number theory) EXAMPLE a(4) = 6:   4 -> 1111   4 -> 211  -> 1111   4 -> 31   -> 1111   4 -> 31   -> 211  -> 1111   4 -> 22   -> 112  -> 1111   4 -> 22   -> 211  -> 1111 CROSSREFS Cf. A002846, A327643, A327697, A327699, A327702. Sequence in context: A079456 A264761 A253882 * A183757 A181490 A165325 Adjacent sequences:  A327695 A327696 A327697 * A327699 A327700 A327701 KEYWORD nonn AUTHOR Alois P. Heinz, Sep 22 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.

Last modified October 29 21:18 EDT 2020. Contains 338074 sequences. (Running on oeis4.)