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.

A300185 Irregular triangle read by rows: T(n, {j,k}) is the number of partitions of n that have exactly j parts equal to k; 1 <= j <= n, 1 <= k <= n.

Table of values

n a(n)
1 1
2 0
3 1
4 1
5 0
6 1
7 0
8 1
9 1
10 0
11 0
12 1
13 0
14 0
15 1
16 1
17 0
18 1
19 1
20 1
21 0
22 0
23 1
24 0
25 0
26 0
27 1
28 0
29 0
30 0
31 2
32 1
33 1
34 0
35 1
36 2
37 1
38 0
39 0
40 0
41 2
42 0
43 0
44 0
45 0
46 1
47 0
48 0
49 0
50 0
51 1
52 0
53 0
54 0
55 0
56 2
57 2
58 1
59 1
60 0
61 1
62 3
63 1
64 1
65 0
66 0
67 0
68 2
69 1
70 0
71 0
72 0
73 0
74 2
75 0
76 0
77 0
78 0
79 0
80 1
81 0
82 0
83 0
84 0
85 0
86 1
87 0
88 0
89 0
90 0
91 0
92 4
93 2
94 2
95 1
96 1
97 0
98 1
99 4
100 2
101 1
102 0
103 0
104 0
105 0
106 4
107 1
108 0
109 0
110 0
111 0
112 0
113 3
114 0

List of values

[1, 0, 1, 1, 0, 1, 0, 1, 1, 0, 0, 1, 0, 0, 1, 1, 0, 1, 1, 1, 0, 0, 1, 0, 0, 0, 1, 0, 0, 0, 2, 1, 1, 0, 1, 2, 1, 0, 0, 0, 2, 0, 0, 0, 0, 1, 0, 0, 0, 0, 1, 0, 0, 0, 0, 2, 2, 1, 1, 0, 1, 3, 1, 1, 0, 0, 0, 2, 1, 0, 0, 0, 0, 2, 0, 0, 0, 0, 0, 1, 0, 0, 0, 0, 0, 1, 0, 0, 0, 0, 0, 4, 2, 2, 1, 1, 0, 1, 4, 2, 1, 0, 0, 0, 0, 4, 1, 0, 0, 0, 0, 0, 3, 0]