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.

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

Original entry on oeis.org

1, 175, 13588, 759501, 36156355, 1583828620, 66491165533, 2737728212583, 112090372848832, 4602189131156358, 190484294908691424, 7973928826104231407, 338278741165301388903, 14560566988020799890812, 636291650516785368941061, 28237066917878338656194296
Offset: 5

Views

Author

Alois P. Heinz, Feb 15 2016

Keywords

Crossrefs

Column k=5 of A245667.