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.

A104443 Square of P(n,t) read by antidiagonals. P(n,t) = number of ways to split [t*n] into n arithmetic progressions each with t terms.

Table of values

n a(n)
1 1
2 1
3 1
4 1
5 3
6 1
7 1
8 2
9 15
10 1
11 1
12 2
13 5
14 105
15 1
16 1
17 2
18 4
19 15
20 945
21 1
22 1
23 2
24 4
25 11
26 55
27 10395
28 1
29 1
30 2
31 4
32 10
33 23
34 232
35 135135
36 1
37 1
38 2
39 4
40 10
41 21
42 68
43 1161
44 2027025
45 1
46 1
47 2
48 4
49 10
50 20
51 59
52 161
53 6643
54 34459425
55 1
56 1
57 2
58 4
59 10
60 20
61 57
62 125
63 488
64 44566
65 654729075
66 1

List of values

[1, 1, 1, 1, 3, 1, 1, 2, 15, 1, 1, 2, 5, 105, 1, 1, 2, 4, 15, 945, 1, 1, 2, 4, 11, 55, 10395, 1, 1, 2, 4, 10, 23, 232, 135135, 1, 1, 2, 4, 10, 21, 68, 1161, 2027025, 1, 1, 2, 4, 10, 20, 59, 161, 6643, 34459425, 1, 1, 2, 4, 10, 20, 57, 125, 488, 44566, 654729075, 1]