cp's OEIS Frontend

This is a front-end for the Online Encyclopedia of Integer Sequences, made by Christian Perfect. The idea is to provide OEIS entries in non-ancient HTML, and then to think about how they're presented visually. The source code is on GitHub.

Previous Showing 11-15 of 15 results.

A268874 Number of sequences in {1,...,n}^n with longest increasing subsequence of length seven.

Original entry on oeis.org

1, 441, 75925, 8578141, 770326261, 60382944557, 4354460873140, 298289430051783, 19813818173777554, 1293896099147297543, 83854915293853035939, 5428948347175827772212, 352760125552869025028101, 23080802877533824013396648, 1524202621890583618051482051
Offset: 7

Views

Author

Alois P. Heinz, Feb 15 2016

Keywords

Crossrefs

Column k=7 of A245667.

A268875 Number of sequences in {1,...,n}^n with longest increasing subsequence of length eight.

Original entry on oeis.org

1, 640, 152911, 23164846, 2714820329, 271759470360, 24588746199473, 2082837287313124, 169027530016448143, 13349998611515172343, 1037605365413191022180, 79994419884937925588421, 6152869874227250487574264, 474174252765810600785056187
Offset: 8

Views

Author

Alois P. Heinz, Feb 15 2016

Keywords

Crossrefs

Column k=8 of A245667.

A268876 Number of sequences in {1,...,n}^n with longest increasing subsequence of length nine.

Original entry on oeis.org

1, 891, 285726, 56443751, 8427587546, 1054512110471, 117393128049604, 12073679346054093, 1176363620435386899, 110485582196129404780, 10128161389764128024757, 914455342093060805784960, 81872118868232022795029323
Offset: 9

Views

Author

Alois P. Heinz, Feb 15 2016

Keywords

Crossrefs

Column k=9 of A245667.

A268877 Number of sequences in {1,...,n}^n with longest increasing subsequence of length ten.

Original entry on oeis.org

1, 1200, 502723, 126590751, 23612496545, 3629560710364, 489403318321789, 60236078765487885, 6951229492238260300, 766382530059604734389, 81829925127960010076736
Offset: 10

Views

Author

Alois P. Heinz, Feb 15 2016

Keywords

Crossrefs

Column k=10 of A245667.

A268949 Number of sequences in {1,...,2n}^(2n) with longest increasing subsequence of length n.

Original entry on oeis.org

1, 3, 175, 23611, 5179791, 1583828620, 621893381187, 298289430051783, 169027530016448143, 110485582196129404780, 81829925127960010076736
Offset: 0

Views

Author

Alois P. Heinz, Feb 16 2016

Keywords

Examples

			a(1) = 3: 11, 21, 22.
a(2) = 175: 1112, 1113, 1114, 1121, ..., 4414, 4423, 4424, 4434.
		

Crossrefs

Cf. A245667.

Formula

a(n) = A245667(2n,n).
Previous Showing 11-15 of 15 results.