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.

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.