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.

A047910 Number of words on {1,1,1,2,2,2,...,n,n,n} with longest increasing subsequence of length n.

Table of values

n a(n)
0 1
1 1
2 19
3 1306
4 195709
5 50775091
6 20117051281
7 11260558754404
8 8445885515991841
9 8167981106765263789
10 9891092676022013399311
11 14655352586540027231760166
12 26075763312196388476329754309
13 54857291862194079908910267234631
14 134685123389924834385817028487259189

List of values

[1, 1, 19, 1306, 195709, 50775091, 20117051281, 11260558754404, 8445885515991841, 8167981106765263789, 9891092676022013399311, 14655352586540027231760166, 26075763312196388476329754309, 54857291862194079908910267234631, 134685123389924834385817028487259189]

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

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