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.

A238883 Array: row n gives number of times each upper triangular partition U(p) occurs as p ranges through the partitions of n.

Table of values

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

List of values

[1, 2, 3, 4, 1, 4, 3, 8, 1, 2, 10, 3, 2, 14, 5, 2, 1, 20, 3, 4, 2, 1, 30, 3, 2, 1, 6, 36, 13, 2, 3, 2, 52, 10, 4, 6, 3, 2, 70, 9, 9, 4, 6, 3, 94, 16, 6, 5, 10, 2, 2, 122, 24, 4, 8, 1, 12, 2, 2, 1, 160, 33, 4, 12, 6, 4, 9, 2, 1, 206, 37, 18, 14, 6, 2, 6, 8]