Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A067231
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A067231 Number of Young tableaux with n=i*j cells and type i*j matrices. Here i and j is i=>j. +0
1
1, 1, 1, 3, 1, 6, 1, 15, 43, 43, 1, 595, 1, 430, 6007, 25455, 1, 92379, 1, 1679601, 1385671, 58787, 1, 163809451, 701149021, 742901, 414315331, 13675080331, 1, 404155466746, 1, 1489913284351, 145862174641, 129644791, 278607172289161 (list; graph; listen)
OFFSET

1,4

FORMULA

a(n) = number of ways to arrange the numbers 1, 2, .., n=i*j in i*j matrices so that each row and each column is increasing. Here i and j satisfy i >= j.

CROSSREFS

Cf. A000085, A060854.

Sequence in context: A145063 A007650 A165552 this_sequence A145791 A130302 A134546

Adjacent sequences: A067228 A067229 A067230 this_sequence A067232 A067233 A067234

KEYWORD

easy,nonn

AUTHOR

Naohiro Nomoto (n_nomoto(AT)yabumi.com), Feb 20 2002

page 1

Search completed in 0.002 seconds

Lookup | Welcome | Find friends | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Transforms | Puzzles | Hot | Classics
More pages | Superseeker | Maintained by N. J. A. Sloane (njas@research.att.com)

Last modified December 15 00:47 EST 2009. Contains 170825 sequences.


AT&T Labs Research