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.

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

Table of values

n a(n)
0 0
1 0
2 1
3 43
4 1879
5 102011
6 7235651
7 674641325
8 81537026047
9 12498099730471
10 2375632826877259
11 548818073236649129
12 151476182218777630655
13 49229890784448694885163
14 18608906461974462064310179
15 8094874797394331233877338741
16 4015057931973886657462193434111

List of values

[0, 0, 1, 43, 1879, 102011, 7235651, 674641325, 81537026047, 12498099730471, 2375632826877259, 548818073236649129, 151476182218777630655, 49229890784448694885163, 18608906461974462064310179, 8094874797394331233877338741, 4015057931973886657462193434111]

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

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