k-ary tree integer sequences by Cha

k-ary tree integer sequences by Cha

k-ary tree types	functions	Unary	Binary	Ternary
Combinatorics	k-ary tree factorial _[1]	A000142	A052129	A123851
Complete trees	sum of inclusive heights _[2]	A000217	A005187	A127427
Complete trees	sum of exclusive heights _[2]	A000217	A011371	A213512
Size Blanaced trees	sum of inclusive heights _[2]	-	A213508	A213513
Size Blanaced trees	sum of exclusive heights _[2]	-	A213209	A213514
Null Blanaced trees	sum of inclusive depths _[2]	-	A001855	A213510
Null Blanaced trees	sum of exclusive depths _[2]	-	A061168	A213511
Parity based Divide and Conquer tree _[3]	fog_k(n)	-	A215673 piano	A215674 piano
Parity based leave one out Divide and Conquer tree _[3]	f'og_k(n)	-	A215675 piano	A215676 piano

[1] S.-H. Cha, On the k-ary Tree Combinatorics, Pace university CSIS technical report No 284, May 2011

[2] S.-H. Cha, On Complete and Size Balanced k-ary Tree Integer Sequences, in International Journal of Applied Mathematics and Informatics Vol 6 issue 2, 2012, pp67-75

[3] S.-H. Cha, On Parity based Divide and Conquer Recursive Functions, International Conference on Computer Science and Applications, San Francisco, USA, Oct 2012.