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.

A118198 Triangle read by rows: T(n,k) is the number of partitions of n having k parts equal to the size of the Durfee square (0<=k<=n).

Table of values

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

List of values

[1, 0, 1, 1, 0, 1, 1, 1, 0, 1, 1, 1, 2, 0, 1, 1, 2, 2, 1, 0, 1, 2, 3, 2, 2, 1, 0, 1, 3, 4, 3, 2, 1, 1, 0, 1, 5, 6, 4, 2, 2, 1, 1, 0, 1, 7, 8, 5, 4, 2, 1, 1, 1, 0, 1, 10, 11, 8, 5, 2, 2, 1, 1, 1, 0, 1, 13, 15, 11, 7, 3, 2, 1, 1, 1, 1, 0, 1, 18, 20, 16, 9, 5, 2, 2, 1, 1, 1, 1, 0, 1, 23, 27, 21, 13, 6, 3, 2, 1]