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.

A238326 Array: row n gives the number of occurrences of each possible diagonal partition of n, arranged in reverse Mathematica order.

Table of values

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

List of values

[1, 2, 3, 4, 1, 5, 2, 6, 3, 2, 7, 4, 4, 8, 5, 6, 3, 9, 6, 8, 6, 1, 10, 7, 10, 9, 4, 2, 11, 8, 12, 12, 8, 3, 2, 12, 9, 14, 15, 12, 5, 4, 4, 2, 13, 10, 16, 18, 16, 10, 5, 6, 3, 4, 14, 11, 18, 21, 20, 15, 6, 6, 8, 6, 6, 4, 15, 12, 20, 24, 24, 20, 7, 12, 10, 9, 8]