login
The OEIS is supported by the many generous donors to the OEIS Foundation.

 

Logo

Year-end appeal: Please make a donation to the OEIS Foundation to support ongoing development and maintenance of the OEIS. We are now in our 59th year, we have over 358,000 sequences, and we’ve crossed 10,300 citations (which often say “discovered thanks to the OEIS”).

Other ways to Give
Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A268949 Number of sequences in {1,...,2n}^(2n) with longest increasing subsequence of length n. 1
1, 3, 175, 23611, 5179791, 1583828620, 621893381187, 298289430051783, 169027530016448143, 110485582196129404780, 81829925127960010076736 (list; graph; refs; listen; history; text; internal format)
OFFSET

0,2

LINKS

Table of n, a(n) for n=0..10.

FORMULA

a(n) = A245667(2n,n).

EXAMPLE

a(1) = 3: 11, 21, 22.

a(2) = 175: 1112, 1113, 1114, 1121, ..., 4414, 4423, 4424, 4434.

CROSSREFS

Cf. A245667.

Sequence in context: A299462 A300105 A125711 * A113270 A091324 A198446

Adjacent sequences: A268946 A268947 A268948 * A268950 A268951 A268952

KEYWORD

nonn

AUTHOR

Alois P. Heinz, Feb 16 2016

STATUS

approved

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Style Sheet | Transforms | Superseeker | Recents
The OEIS Community | Maintained by The OEIS Foundation Inc.

License Agreements, Terms of Use, Privacy Policy. .

Last modified December 1 01:13 EST 2022. Contains 358453 sequences. (Running on oeis4.)