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.

A268698 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.

Table of values

n a(n)
0 1
1 1
2 2
3 4
4 13
5 36
6 157
7 554
8 2800
9 12530
10 70772
11 362188
12 2370564
13 13658713
14 95366064
15 642861687
16 4774830263
17 34769374156
18 288999332899
19 2255537559077
20 19693313843687
21 172690825379198
22 1572921138465599
23 14538979953843188
24 145980379536597239

List of values

[1, 1, 2, 4, 13, 36, 157, 554, 2800, 12530, 70772, 362188, 2370564, 13658713, 95366064, 642861687, 4774830263, 34769374156, 288999332899, 2255537559077, 19693313843687, 172690825379198, 1572921138465599, 14538979953843188, 145980379536597239]