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.

A008289 Triangle read by rows: Q(n,m) = number of partitions of n into m distinct parts, n>=1, m>=1.

Table of values

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

List of values

[1, 1, 1, 1, 1, 1, 1, 2, 1, 2, 1, 1, 3, 1, 1, 3, 2, 1, 4, 3, 1, 4, 4, 1, 1, 5, 5, 1, 1, 5, 7, 2, 1, 6, 8, 3, 1, 6, 10, 5, 1, 7, 12, 6, 1, 1, 7, 14, 9, 1, 1, 8, 16, 11, 2, 1, 8, 19, 15, 3, 1, 9, 21, 18, 5, 1, 9, 24, 23, 7, 1, 10, 27, 27, 10, 1, 1, 10, 30, 34, 13, 1, 1, 11, 33, 39, 18, 2, 1, 11, 37]