|
| |
|
|
A105291
|
|
Triangle read by rows: T(m,n) = binomial(m!,n), m>=0, 0 <= n <= m!.
|
|
2
| |
|
|
1, 1, 1, 1, 1, 2, 1, 1, 6, 15, 20, 15, 6, 1, 1, 24, 276, 2024, 10626, 42504, 134596, 346104, 735471, 1307504, 1961256, 2496144, 2704156, 2496144, 1961256, 1307504, 735471, 346104, 134596, 42504, 10626, 2024, 276, 24, 1, 1, 120, 7140, 280840, 8214570, 190578024
(list; graph; refs; listen; history; internal format)
|
|
|
|
OFFSET
| 0,6
|
|
|
COMMENTS
| This is the number of nXm arrays with each row a permutation of 1..m, and rows in lexicographically strictly increasing order.
For row 0, remember that 0!=1.
|
|
|
EXAMPLE
| Triangle begins:
[1, 1],
[1, 1],
[1, 2, 1],
[1, 6, 15, 20, 15, 6, 1],
[1, 24, 276, 2024, 10626, 42504, 134596, 346104, 735471, 1307504, 1961256, 2496144, 2704156, 2496144, 1961256, 1307504, 735471, 346104, 134596, 42504, 10626, 2024, 276, 24, 1],
...
|
|
|
CROSSREFS
| See A180397 for another version.
Cf. A007318 (Pascal's triangle), A086687, A109892.
Sequence in context: A039763 A094262 A123554 * A025270 A178234 A144510
Adjacent sequences: A105288 A105289 A105290 * A105292 A105293 A105294
|
|
|
KEYWORD
| nonn,tabf
|
|
|
AUTHOR
| N. J. A. Sloane, Sep 03 2010, following a suggestion from R. H. Hardin, Aug 31 2010
|
| |
|
|
