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.

Table of values

n a(n)
9 1
10 891
11 285726
12 56443751
13 8427587546
14 1054512110471
15 117393128049604
16 12073679346054093
17 1176363620435386899
18 110485582196129404780
19 10128161389764128024757
20 914455342093060805784960
21 81872118868232022795029323

List of values

[1, 891, 285726, 56443751, 8427587546, 1054512110471, 117393128049604, 12073679346054093, 1176363620435386899, 110485582196129404780, 10128161389764128024757, 914455342093060805784960, 81872118868232022795029323]

Started in 1964 by Neil J. A. Sloane | Maintained by The OEIS Foundation Inc.

Content is available under The OEIS End-User License Agreement.