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.

A323345 Square array read by ascending antidiagonals: T(n, k) is the number of partitions of n where parts, if sorted in ascending order, form an arithmetic progression (AP) with common difference of k; n >= 1, k >= 0.

Table of values

n a(n)
1 1
2 2
3 1
4 2
5 1
6 1
7 3
8 2
9 1
10 1
11 2
12 1
13 1
14 1
15 1
16 4
17 2
18 2
19 1
20 1
21 1
22 2
23 2
24 1
25 1
26 1
27 1
28 1
29 4
30 2
31 2
32 2
33 1
34 1
35 1
36 1
37 3
38 1
39 1
40 1
41 1
42 1
43 1
44 1
45 1
46 4
47 3
48 2
49 2
50 2
51 1
52 1
53 1
54 1
55 1
56 2
57 2
58 2
59 1
60 1
61 1
62 1
63 1
64 1
65 1
66 1
67 6
68 2
69 2
70 2
71 2
72 2
73 1
74 1
75 1
76 1
77 1
78 1
79 2
80 2
81 1
82 1
83 1
84 1
85 1
86 1
87 1
88 1
89 1
90 1
91 1

List of values

[1, 2, 1, 2, 1, 1, 3, 2, 1, 1, 2, 1, 1, 1, 1, 4, 2, 2, 1, 1, 1, 2, 2, 1, 1, 1, 1, 1, 4, 2, 2, 2, 1, 1, 1, 1, 3, 1, 1, 1, 1, 1, 1, 1, 1, 4, 3, 2, 2, 2, 1, 1, 1, 1, 1, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 6, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]