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.

A373244 T(n,k) = number of integer partitions of n into k parts for which the number of distinct parts is equal to the number of distinct multiplicities.

Table of values

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

List of values

[1, 1, 1, 1, 0, 1, 1, 1, 1, 1, 1, 0, 2, 1, 1, 1, 1, 2, 1, 1, 1, 1, 0, 3, 2, 2, 1, 1, 1, 1, 3, 2, 2, 2, 1, 1, 1, 0, 4, 2, 3, 1, 2, 1, 1, 1, 1, 4, 3, 2, 4, 2, 2, 1, 1, 1, 0, 5, 3, 4, 5, 4, 2, 2, 1, 1, 1, 1, 5, 3, 3, 5, 4, 3, 2, 2, 1, 1, 1, 0, 6, 4, 5, 8, 6, 5, 4, 2, 2, 1, 1, 1, 1, 6, 4, 5, 10, 6, 7, 5, 4, 2, 2, 1, 1]