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”).

A213510
The sequence N(n) arising in the enumeration of balanced ternary trees.
0
1, 3, 5, 7, 10, 13, 16, 19, 22, 25, 28, 31, 34, 38, 42, 46, 50, 54, 58, 62, 66, 70, 74, 78, 82, 86, 90, 94, 98, 102, 106, 110, 114, 118, 122, 126, 130, 134, 138, 142, 147, 152, 157, 162, 167, 172, 177, 182, 187, 192
OFFSET
1,2
COMMENTS
See Cha (2012) for the precise definition.
Conjecture: partial sums of A064099. - Sean A. Irvine, Jul 14 2022
LINKS
Sung-Hyuk Cha, On Integer Sequences Derived from Balanced k-ary Trees, Applied Mathematics in Electrical and Computer Engineering, 2012.
Sung-Hyuk Cha, On Complete and Size Balanced k-ary Tree Integer Sequences, International Journal of Applied Mathematics and Informatics, Issue 2, Volume 6, 2012, pp. 67-75. - From N. J. A. Sloane, Dec 24 2012
CROSSREFS
Sequence in context: A298862 A198409 A330072 * A130257 A276498 A186148
KEYWORD
nonn
AUTHOR
N. J. A. Sloane, Jun 12 2012
STATUS
approved