A268701 - cp's OEIS frontend

A268701 Total number of sequences with c_j copies of j and longest increasing subsequence of length k summed over all compositions [c_1, c_2, ..., c_k] of n into distinct parts.

n	a(n)
0	1
1	1
2	1
3	5
4	7
5	27
6	195
7	421
8	1619
9	8675
10	105757
11	274029
12	1402193
13	6625987
14	55349787
15	975068069
16	3137395939
17	17960895375
18	101880880461
19	696011551909
20	7596647200175
21	197122787505191
22	723879298052695
23	4905597865756059
24	29537689035766501
25	227793692735075911

[1, 1, 1, 5, 7, 27, 195, 421, 1619, 8675, 105757, 274029, 1402193, 6625987, 55349787, 975068069, 3137395939, 17960895375, 101880880461, 696011551909, 7596647200175, 197122787505191, 723879298052695, 4905597865756059, 29537689035766501, 227793692735075911]

cp's OEIS Frontend

A268701 Total number of sequences with c_j copies of j and longest increasing subsequence of length k summed over all compositions [c_1, c_2, ..., c_k] of n into distinct parts.

Table of values

List of values