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.

A182485 Number of partitions of n into exactly k different parts with distinct multiplicities; triangle T(n,k), n>=0, 0<=k<=max{i:A000292(i)<=n}, read by rows.

Table of values

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

List of values

[1, 0, 1, 0, 2, 0, 2, 0, 3, 1, 0, 2, 3, 0, 4, 3, 0, 2, 8, 0, 4, 9, 0, 3, 12, 0, 4, 16, 1, 0, 2, 22, 4, 0, 6, 20, 5, 0, 2, 31, 12, 0, 4, 35, 16, 0, 4, 34, 24, 0, 5, 44, 33, 0, 2, 51, 52, 0, 6, 53, 57, 0, 2, 62, 89, 0, 6, 65, 100, 1, 0, 4, 68, 131, 5, 0, 4, 87]