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!)
A131427 A000108(n) preceded by n zeros. 6
1, 0, 1, 0, 0, 2, 0, 0, 0, 5, 0, 0, 0, 0, 14, 0, 0, 0, 0, 0, 42, 0, 0, 0, 0, 0, 0, 132, 0, 0, 0, 0, 0, 0, 0, 429, 0, 0, 0, 0, 0, 0, 0, 0, 1430, 0, 0, 0, 0, 0, 0, 0, 0, 0, 4862, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 16796, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 58786, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 208012 (list; table; graph; refs; listen; history; text; internal format)
OFFSET
0,6
COMMENTS
Triangle given by A000004 DELTA A000012 where DELTA is the operator defined in A084938. - Philippe Deléham, Jul 12 2007
T(n,k) is the number of Dyck paths of semilength n having exactly k U=(1,1) steps. - Alois P. Heinz, Jun 09 2014
LINKS
FORMULA
A000108(n) preceded by n zeros, as an infinite lower triangular matrix.
EXAMPLE
First few rows of the triangle are:
1;
0, 1;
0, 0, 2;
0, 0, 0, 5;
0, 0, 0, 0, 14;
0, 0, 0, 0, 0, 42;
...
MAPLE
T:= (n, k)-> `if`(k<n, 0, binomial(2*n, n)/(n+1)):
seq(seq(T(n, k), k=0..n), n=0..15); # Alois P. Heinz, Jun 09 2014
MATHEMATICA
T[n_, n_] := CatalanNumber[n]; T[_, _] = 0;
Table[T[n, k], {n, 0, 15}, {k, 0, n}] // Flatten (* Jean-François Alcover, May 20 2016 *)
CROSSREFS
Sequence in context: A328820 A259863 A283666 * A153198 A182492 A222898
KEYWORD
nonn,tabl
AUTHOR
Gary W. Adamson, Jul 10 2007
EXTENSIONS
More terms from Philippe Deléham, Oct 16 2008
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 18 20:26 EDT 2024. Contains 371781 sequences. (Running on oeis4.)