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.

A209669 T(n,k) = count of degree k monomials in the elementary symmetric polynomials e(mu,k) summed over all partitions mu of n.

Table of values

n a(n)
1 1
2 1
3 5
4 1
5 10
6 37
7 1
8 21
9 120
10 405
11 1
12 42
13 363
14 1644
15 5251
16 1
17 85
18 1117
19 6814
20 27405
21 84893
22 1
23 170
24 3360
25 27404
26 138085
27 514248
28 1556535
29 1
30 341
31 10164
32 111045
33 701960
34 3145848
35 11133493
36 33175957
37 1
38 682
39 30520
40 445132
41 3521405
42 18956548
43 78337448

List of values

[1, 1, 5, 1, 10, 37, 1, 21, 120, 405, 1, 42, 363, 1644, 5251, 1, 85, 1117, 6814, 27405, 84893, 1, 170, 3360, 27404, 138085, 514248, 1556535, 1, 341, 10164, 111045, 701960, 3145848, 11133493, 33175957, 1, 682, 30520, 445132, 3521405, 18956548, 78337448]