login
The OEIS is supported by the many generous donors to the OEIS Foundation.

 

Logo
Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A127541 Triangle read by rows: T(n,k) is the number of ordered trees with n edges having k even-length branches starting at the root (0<=k<=n). 2
1, 1, 1, 1, 3, 2, 8, 5, 1, 24, 15, 3, 75, 46, 10, 1, 243, 148, 34, 4, 808, 489, 116, 16, 1, 2742, 1652, 402, 61, 5, 9458, 5678, 1408, 228, 23, 1, 33062, 19792, 4982, 847, 97, 6, 116868, 69798, 17783, 3138, 393, 31, 1, 417022, 248577, 63967, 11627, 1557, 143, 7 (list; graph; refs; listen; history; text; internal format)
OFFSET
0,5
COMMENTS
Row n has 1+floor(n/2) terms. Row sums are the Catalan numbers (A000108). T(n,0)=A000958(n-1). Sum(k*T(n,k),k=0..floor(n/2))=A127540(n-1).
LINKS
FORMULA
G.f.=(1+z)/(1+z-z*C-tz^2*C), where C =[1-sqrt(1-4z)]/(2z) is the Catalan function.
EXAMPLE
T(2,0)=1 because we have the tree /\.
Triangle starts:
1;
1;
1,1;
3,2;
8,5,1;
24,15,3;
MAPLE
C:=(1-sqrt(1-4*z))/2/z: G:=(1+z)/(1+z-z*C-t*z^2*C): Gser:=simplify(series(G, z=0, 17)): for n from 0 to 14 do P[n]:=sort(coeff(Gser, z, n)) od: for n from 0 to 14 do seq(coeff(P[n], t, j), j=0..floor(n/2)) od; # yields sequence in triangular form
CROSSREFS
Sequence in context: A129199 A211164 A097018 * A053219 A173030 A271589
KEYWORD
nonn,tabf
AUTHOR
Emeric Deutsch, Mar 01 2007
STATUS
approved

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Style Sheet | Transforms | Superseeker | Recents
The OEIS Community | Maintained by The OEIS Foundation Inc.

License Agreements, Terms of Use, Privacy Policy. .

Last modified April 24 03:08 EDT 2024. Contains 371918 sequences. (Running on oeis4.)