cp's OEIS Frontend

This is a front-end for the Online Encyclopedia of Integer Sequences, made by Christian Perfect. The idea is to provide OEIS entries in non-ancient HTML, and then to think about how they're presented visually. The source code is on GitHub.

A213510 The sequence N(n) arising in the enumeration of balanced ternary trees.

This page as a plain text file.
%I A213510 #12 Jul 14 2022 17:25:13
%S A213510 1,3,5,7,10,13,16,19,22,25,28,31,34,38,42,46,50,54,58,62,66,70,74,78,
%T A213510 82,86,90,94,98,102,106,110,114,118,122,126,130,134,138,142,147,152,
%U A213510 157,162,167,172,177,182,187,192
%N A213510 The sequence N(n) arising in the enumeration of balanced ternary trees.
%C A213510 See Cha (2012) for the precise definition.
%C A213510 Conjecture: partial sums of A064099. - _Sean A. Irvine_, Jul 14 2022
%H A213510 Sung-Hyuk Cha, <a href="http://www.wseas.us/e-library/conferences/2012/CambridgeUSA/MATHCC/MATHCC-60.pdf">On Integer Sequences Derived from Balanced k-ary Trees</a>, Applied Mathematics in Electrical and Computer Engineering, 2012.
%H A213510 Sung-Hyuk Cha, <a href="http://naun.org/multimedia/UPress/ami/16-125.pdf">On Complete and Size Balanced k-ary Tree Integer Sequences</a>, International Journal of Applied Mathematics and Informatics, Issue 2, Volume 6, 2012, pp. 67-75. - From _N. J. A. Sloane_, Dec 24 2012
%K A213510 nonn
%O A213510 1,2
%A A213510 _N. J. A. Sloane_, Jun 12 2012