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.

A157045 Triangular table: number of partitions of n into exactly n-k parts, each <= n-k. Same as A157044 but with rows reversed.

Table of values

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

List of values

[1, 1, 0, 1, 1, 0, 1, 1, 1, 0, 1, 1, 2, 0, 0, 1, 1, 2, 2, 0, 0, 1, 1, 2, 3, 2, 0, 0, 1, 1, 2, 3, 4, 1, 0, 0, 1, 1, 2, 3, 5, 4, 1, 0, 0, 1, 1, 2, 3, 5, 6, 5, 0, 0, 0, 1, 1, 2, 3, 5, 7, 8, 4, 0, 0, 0, 1, 1, 2, 3, 5, 7, 10, 9, 4, 0, 0, 0, 1, 1, 2, 3, 5, 7, 11, 12, 11, 3, 0, 0, 0, 1, 1, 2, 3, 5, 7, 11, 14, 16, 11]