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.

A268700 Total number of sequences with p_j copies of j and longest increasing subsequence of length k summed over all partitions [p_1, p_2, ..., p_k] of n into distinct parts.

Table of values

n a(n)
0 1
1 1
2 1
3 3
4 4
5 14
6 46
7 111
8 330
9 1614
10 7348
11 21340
12 98145
13 379405
14 2633085
15 14871033
16 57284558
17 278927415
18 1609313975
19 8289565670
20 74945364815
21 522977754235
22 2403799401259
23 14180489136597
24 83964652635668
25 623008803758260
26 3918144764978718
27 46950727351392315

List of values

[1, 1, 1, 3, 4, 14, 46, 111, 330, 1614, 7348, 21340, 98145, 379405, 2633085, 14871033, 57284558, 278927415, 1609313975, 8289565670, 74945364815, 522977754235, 2403799401259, 14180489136597, 83964652635668, 623008803758260, 3918144764978718, 46950727351392315]