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.

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.