The OEIS is supported by the many generous donors to the OEIS Foundation.

 Year-end appeal: Please make a donation to the OEIS Foundation to support ongoing development and maintenance of the OEIS. We are now in our 59th year, we have over 358,000 sequences, and we’ve crossed 10,300 citations (which often say “discovered thanks to the OEIS”). Other ways to Give
 Hints (Greetings from The On-Line Encyclopedia of Integer Sequences!)
 A329758 Number of n-th generation nodes of a rooted binary tree whose m-th node has exactly A000002(m) descendants, where A000002 is the Kolakoski sequence. 2
 1, 1, 2, 3, 4, 7, 10, 15, 22, 34, 51, 76, 114, 171, 257, 385, 575, 862, 1295, 1941, 2916, 4374, 6558, 9840, 14766, 22151, 33236, 49864, 74775, 112144, 168198, 252313, 378489, 567747, 851649, 1277446, 1916182, 2874172, 4311325, 6466984, 9700248, 14550387, 21825590 (list; graph; refs; listen; history; text; internal format)
 OFFSET 1,3 LINKS Jack W Grahl, Table of n, a(n) for n = 1..43 FORMULA a(n) = A054353(a(1) + ... + a(n-1)) - A054353(a(1) + ... + a(n-2)) for n > 2. PROG (Python) def A329758(): x = 1 g = A000002() while True: yield x acc = 0 for i in range(0, x): acc = acc + next(g) x = acc # Jack W Grahl, May 04 2020 CROSSREFS Cf. A000002, A054353. Sequence in context: A078159 A129490 A018132 * A100638 A319437 A270659 Adjacent sequences: A329755 A329756 A329757 * A329759 A329760 A329761 KEYWORD nonn AUTHOR Jakub Zaborowski, Nov 20 2019 EXTENSIONS More terms from Jack W Grahl, May 04 2020 STATUS approved

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

Last modified December 5 02:30 EST 2022. Contains 358572 sequences. (Running on oeis4.)