|
Search: id:A123382
|
|
|
| A123382 |
|
Triangle T(n,k), 0<=k<=n, defined by : T(n,k)=0 if k<0, T(0,k)=0^k, (n+2)*(2n-2k+1)*T(n,k)=(2n+1)*[4*2n-2k+1)*T(n-1,k-1)+(n+2k+2)*T(n-1,k)]. |
|
+0
1
|
|
| 1, 1, 4, 1, 15, 20, 1, 35, 168, 112, 1, 66, 714, 1680, 672, 1, 110, 2178, 11352, 15840, 4224
(list; table; graph; listen)
|
|
|
OFFSET
|
0,3
|
|
|
REFERENCES
|
Germain Kreweras, Sur une classe de problemes de denombrement lies au treillis des partitions des entiers, p. 95, Theses, Paris (1965)
|
|
FORMULA
|
T(n,n)=A003645(n).
|
|
EXAMPLE
|
Triangle begins:
1;
1, 4;
1, 15, 20;
1, 35, 168, 112;
1, 66, 714, 1680, 672;
1, 110, 2178, 11352, 15840, 4224;
|
|
CROSSREFS
|
Sequence in context: A095307 A124029 A056920 this_sequence A059222 A117292 A062780
Adjacent sequences: A123379 A123380 A123381 this_sequence A123383 A123384 A123385
|
|
KEYWORD
|
nonn,tabl
|
|
AUTHOR
|
Philippe DELEHAM (kolotoko(AT)wanadoo.fr), Oct 13 2006
|
|
|
Search completed in 0.002 seconds
|
