|
Search: id:A061343
|
|
|
| A061343 |
|
Number of standard shifted tableaux with n entries. |
|
+0
1
|
|
| 1, 1, 2, 3, 6, 12, 27, 63, 154, 398, 1055, 2970, 8503, 25651, 78483, 250487, 811802, 2723130, 9295483, 32653552
(list; graph; listen)
|
|
|
OFFSET
|
1,3
|
|
|
REFERENCES
|
D. Knuth, The art of computer programming, Vol. 3 (Sorting and searching), page 71, Section 5.1.4 Exercise 21.
R. M. Thrall, A combinatorial problem. Michigan Math. J. 1, (1952). 81-88.
|
|
LINKS
|
R. M. Thrall, A combinatorial problem, Michigan Math. J. 1, (1952), 81-88.
|
|
CROSSREFS
|
Sequence in context: A019525 A108915 A082395 this_sequence A057649 A104872 A006082
Adjacent sequences: A061340 A061341 A061342 this_sequence A061344 A061345 A061346
|
|
KEYWORD
|
nonn,nice
|
|
AUTHOR
|
V. Reiner and D. White (reiner(AT)math.umn.edu), Jun 07 2001
|
|
|
Search completed in 0.002 seconds
|
