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.

A072233 Square array T(n,k) read by antidiagonals giving number of ways to distribute n indistinguishable objects in k indistinguishable containers; containers may be left empty.

Table of values

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

List of values

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