|
Search: id:A132372
|
|
|
| A132372 |
|
Triangle T(n,k), read by rows ; T(n,k) counts Schroeder n-paths whose ascent starting at the initial vertex has length k . |
|
+0 1
|
|
| 1, 1, 1, 2, 3, 1, 6, 10, 5, 1, 22, 38, 22, 7, 1, 90, 158, 98, 38, 9, 1, 394, 698, 450, 194, 58, 11, 1, 1806, 3218, 2126, 978, 334, 82, 13, 1, 8558, 15310, 10286, 4942, 1838, 526, 110, 15, 1, 41586, 74614, 50746, 25150, 9922, 3142, 778, 142, 17, 1
(list; table; graph; listen)
|
|
|
OFFSET
|
0,4
|
|
|
COMMENT
|
Triangle T(n,k), 0<=k<=n, read by rows given by [1,1,2,1,2,1,2,1,2,...] DELTA [1,0,0,0,0,0,0,0,...] where DELTA is the operator defined in A084938 .
|
|
FORMULA
|
Sum_{k, 0<=k<=n}T(n,k)=A006318(n) .
|
|
EXAMPLE
|
Triangle begins:
1;
1, 1;
2, 3, 1;
6, 10, 5, 1;
22, 38, 22, 7, 1;
90, 158, 98, 38, 9, 1;
394, 698, 450, 194, 58, 11, 1;
1806, 3218, 2126, 978, 334, 82, 13, 1;
8558, 15310, 10286, 4942, 1838, 526, 110, 15, 1;
41586, 74614, 50746, 25150, 9922, 3142, 778, 142, 17, 1 ;...
|
|
CROSSREFS
|
Cf. A006318, A103136 (signed version).
Sequence in context: A100822 A086211 A110189 this_sequence A103136 A086960 A138771
Adjacent sequences: A132369 A132370 A132371 this_sequence A132373 A132374 A132375
|
|
KEYWORD
|
easy,nonn,tabl
|
|
AUTHOR
|
Philippe DELEHAM (kolotoko(AT)wanadoo.fr), Nov 20 2007
|
|
|
Search completed in 0.002 seconds
|