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.

A133121 Triangle T(n,k) read by rows = number of partitions of n such that number of parts minus number of distinct parts is equal to k, k = 0..n-1.

Table of values

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

List of values

[1, 1, 1, 2, 0, 1, 2, 2, 0, 1, 3, 2, 1, 0, 1, 4, 2, 3, 1, 0, 1, 5, 4, 2, 2, 1, 0, 1, 6, 6, 3, 3, 2, 1, 0, 1, 8, 7, 5, 4, 2, 2, 1, 0, 1, 10, 8, 10, 3, 5, 2, 2, 1, 0, 1, 12, 13, 8, 9, 4, 4, 2, 2, 1, 0, 1, 15, 15, 14, 10, 8, 5, 4, 2, 2, 1, 0, 1, 18, 21, 15, 16, 8, 9, 4, 4, 2, 2, 1, 0, 1, 22, 25, 23, 17, 17, 7, 10, 4, 4, 2, 2, 1, 0, 1]