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!)
 A327699 Number of refinement sequences n -> ... -> {1}^n, where in each step every single part of a nonempty selection of parts is replaced by a partition of itself into two smaller parts (in weakly decreasing order). 4
 1, 1, 1, 4, 9, 48, 211, 1736, 9777, 91169, 739174, 8613817, 83763730, 1105436491, 13222076337, 207852246589, 2789691577561, 47759515531854, 755158220565169, 14595210284816038, 255814560447492788, 5373613110108953192, 105867623217924984398, 2460702471446564481641 (list; graph; refs; listen; history; text; internal format)
 OFFSET 1,4 LINKS Wikipedia, Partition (number theory) EXAMPLE a(4) = 4:   4 -> 31   -> 211  -> 1111   4 -> 22   -> 1111   4 -> 22   -> 112  -> 1111   4 -> 22   -> 211  -> 1111 CROSSREFS Cf. A002846, A327643, A327697, A327698, A327702. Sequence in context: A298986 A103933 A256880 * A013495 A164839 A225885 Adjacent sequences:  A327696 A327697 A327698 * A327700 A327701 A327702 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 February 20 17:04 EST 2020. Contains 332080 sequences. (Running on oeis4.)