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.

A162663 Table by antidiagonals, T(n,k) is the number of partitions of {1..(nk)} that are invariant under a permutation consisting of n k-cycles.

Table of values

n a(n)
0 1
1 1
2 1
3 1
4 2
5 2
6 1
7 2
8 7
9 5
10 1
11 3
12 8
13 31
14 15
15 1
16 2
17 16
18 42
19 164
20 52
21 1
22 4
23 10
24 111
25 268
26 999
27 203
28 1
29 2
30 28
31 70
32 931
33 1994
34 6841
35 877
36 1
37 4
38 12
39 258
40 602
41 9066
42 16852
43 51790
44 4140
45 1
46 3
47 31
48 106
49 2892
50 6078
51 99925
52 158778
53 428131
54 21147
55 1
56 4
57 22
58 329
59 1144
60 37778
61 70402
62 1224579
63 1644732
64 3827967
65 115975

List of values

[1, 1, 1, 1, 2, 2, 1, 2, 7, 5, 1, 3, 8, 31, 15, 1, 2, 16, 42, 164, 52, 1, 4, 10, 111, 268, 999, 203, 1, 2, 28, 70, 931, 1994, 6841, 877, 1, 4, 12, 258, 602, 9066, 16852, 51790, 4140, 1, 3, 31, 106, 2892, 6078, 99925, 158778, 428131, 21147, 1, 4, 22, 329, 1144, 37778, 70402, 1224579, 1644732, 3827967, 115975]