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.

A381426 A(n,k) is the sum over all ordered partitions of [n] of k^j for an ordered 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 3
9 4
10 1
11 1
12 4
13 13
14 8
15 1
16 1
17 5
18 36
19 75
20 16
21 1
22 1
23 6
24 79
25 696
26 541
27 32
28 1
29 1
30 7
31 148
32 3851
33 27808
34 4683
35 64
36 1
37 1
38 8
39 249
40 14808
41 567733
42 2257888
43 47293
44 128
45 1
46 1
47 9
48 388
49 44643
50 5942608
51 251790113
52 369572160
53 545835
54 256
55 1
56 1
57 10
58 571
59 113480
60 40065301
61 9546508128
62 335313799327
63 121459776768
64 7087261
65 512

List of values

[1, 1, 1, 1, 1, 2, 1, 1, 3, 4, 1, 1, 4, 13, 8, 1, 1, 5, 36, 75, 16, 1, 1, 6, 79, 696, 541, 32, 1, 1, 7, 148, 3851, 27808, 4683, 64, 1, 1, 8, 249, 14808, 567733, 2257888, 47293, 128, 1, 1, 9, 388, 44643, 5942608, 251790113, 369572160, 545835, 256, 1, 1, 10, 571, 113480, 40065301, 9546508128, 335313799327, 121459776768, 7087261, 512]