this paper for two problems concerning
the enumeration of trees and ballot sequences, in which the above -- mentioned conditions,
which finally yield the Catalan and generalized Catalan numbers, are slightly modified. We
want to count trees, in which every vertex has at most s successors and ballot sequences,
which fulfill the condition
1
wt(x 1 ; : : : ; x i )
%0 Generic
%1 citeulike:408037
%A Tamm, U.
%D 1997
%K enumeration like pascal sequences triangles
%T Pascal--like triangles in the enumeration of trees and sequences
%U http://citeseer.ist.psu.edu/365548.html
%X this paper for two problems concerning
the enumeration of trees and ballot sequences, in which the above -- mentioned conditions,
which finally yield the Catalan and generalized Catalan numbers, are slightly modified. We
want to count trees, in which every vertex has at most s successors and ballot sequences,
which fulfill the condition
1
wt(x 1 ; : : : ; x i )
@misc{citeulike:408037,
abstract = {this paper for two problems concerning
the enumeration of trees and ballot sequences, in which the above -- mentioned conditions,
which finally yield the Catalan and generalized Catalan numbers, are slightly modified. We
want to count trees, in which every vertex has at most s successors and ballot sequences,
which fulfill the condition
1
wt(x 1 ; : : : ; x i )},
added-at = {2007-08-18T13:22:24.000+0200},
author = {Tamm, U.},
biburl = {https://www.bibsonomy.org/bibtex/2e942464117197460a17e0dfd52844c44/a_olympia},
citeulike-article-id = {408037},
description = {citeulike},
interhash = {9edeb04ae7c6b16788515be03e969ecf},
intrahash = {e942464117197460a17e0dfd52844c44},
keywords = {enumeration like pascal sequences triangles},
priority = {2},
timestamp = {2007-08-18T13:22:38.000+0200},
title = {Pascal--like triangles in the enumeration of trees and sequences},
url = {http://citeseer.ist.psu.edu/365548.html},
year = 1997
}