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

 

Logo
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
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
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 April 16 01:01 EDT 2024. Contains 371696 sequences. (Running on oeis4.)