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.

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.