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.

A241150 Irregular triangle read by rows T(n,k) = number of partitions of degree k in the partition graph G(n), for n >= 2; G(n) is defined in Comments.

Table of values

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

List of values

[2, 2, 1, 3, 1, 1, 2, 3, 2, 4, 2, 4, 1, 2, 6, 5, 1, 1, 4, 5, 8, 3, 2, 3, 8, 10, 4, 5, 4, 10, 13, 5, 9, 1, 2, 13, 17, 8, 14, 1, 1, 6, 12, 22, 10, 22, 3, 2, 2, 19, 27, 11, 32, 5, 5, 4, 21, 33, 15, 43, 9, 10, 4, 20, 44, 21, 57, 10, 19, 1, 5, 28, 50, 20, 77, 20]