Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A047888
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A047888 Rectangular array of numbers a(n,k) = number of permutations of n things with longest increasing subsequence of length <=k (1<=k<=infinity), read by antidiagonals. +0
7
1, 1, 1, 1, 2, 1, 1, 5, 2, 1, 1, 14, 6, 2, 1, 1, 42, 23, 6, 2, 1, 1, 132, 103, 24, 6, 2, 1, 1, 429, 513, 119, 24, 6, 2, 1, 1, 1430, 2761, 694, 120, 24, 6, 2, 1, 1, 4862, 15767, 4582, 719, 120, 24, 6, 2, 1, 1, 16796, 94359, 33324, 5003, 720, 120, 24, 6, 2, 1, 1, 58786, 586590 (list; table; graph; listen)
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 November 27 22:38 EST 2009. Contains 167602 sequences.


AT&T Labs Research