login

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 61st year, we have over 378,000 sequences, and we’ve reached 11,000 citations (which often say “discovered thanks to the OEIS”).

A173282
Partial sums of A001190.
0
0, 1, 2, 3, 5, 8, 14, 25, 48, 94, 192, 399, 850, 1833, 4012, 8862, 19767, 44398, 100409, 228321, 521868, 1198025, 2761397, 6387546, 14823925, 34504202, 80530820, 188421429, 441872140, 1038444527, 2445263286, 5768499524, 13631457915, 32263783234, 76478352334
OFFSET
0,3
COMMENTS
The largest rank for some unlabeled binary rooted tree with n leaves (n>0) in a simple bijection between unlabeled binary rooted trees and positive integers. -Noah A Rosenberg, Jun 14 2022
FORMULA
a(n) = Sum_{i=0..n} A001190(i).
CROSSREFS
Cf. A001190.
Sequence in context: A119262 A177510 A062178 * A178833 A212657 A065955
KEYWORD
nonn
AUTHOR
Jonathan Vos Post, Feb 14 2010
EXTENSIONS
a(25) corrected by Georg Fischer, Aug 28 2020
STATUS
approved