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.

A381369 A(n,k) is the sum over all partitions of [n] of k^j for a partition with j inversions; square array A(n,k), n>=0, k>=0, read by antidiagonals.

Table of values

n a(n)
0 1
1 1
2 1
3 1
4 1
5 2
6 1
7 1
8 2
9 4
10 1
11 1
12 2
13 5
14 8
15 1
16 1
17 2
18 6
19 15
20 16
21 1
22 1
23 2
24 7
25 28
26 52
27 32
28 1
29 1
30 2
31 8
32 47
33 204
34 203
35 64
36 1
37 1
38 2
39 9
40 72
41 628
42 2344
43 877
44 128
45 1
46 1
47 2
48 10
49 103
50 1552
51 17327
52 43160
53 4140
54 256
55 1
56 1
57 2
58 11
59 140
60 3276
61 84416
62 1022983
63 1291952
64 21147
65 512

List of values

[1, 1, 1, 1, 1, 2, 1, 1, 2, 4, 1, 1, 2, 5, 8, 1, 1, 2, 6, 15, 16, 1, 1, 2, 7, 28, 52, 32, 1, 1, 2, 8, 47, 204, 203, 64, 1, 1, 2, 9, 72, 628, 2344, 877, 128, 1, 1, 2, 10, 103, 1552, 17327, 43160, 4140, 256, 1, 1, 2, 11, 140, 3276, 84416, 1022983, 1291952, 21147, 512]