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.

A337586 Triangle read by rows: T(n, k) is the number of integer multisets of size k (partitions of k) for which the number of partitions of n with matching multiplicity multiset is odd (n >= 1, 1 <= k <= n).

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

List of values

[1, 1, 1, 1, 1, 1, 1, 2, 1, 1, 1, 0, 0, 1, 1, 1, 1, 3, 2, 1, 1, 1, 1, 2, 1, 2, 1, 1, 1, 2, 1, 3, 3, 2, 1, 1, 1, 0, 3, 0, 3, 3, 2, 1, 1, 1, 1, 0, 3, 3, 3, 3, 2, 1, 1, 1, 1, 2, 3, 2, 1, 5, 3, 2, 1, 1, 1, 2, 2, 1, 3, 7, 3, 5, 3, 2, 1, 1, 1, 0, 0, 2, 2, 2, 5, 3, 5, 3, 2, 1, 1, 1, 1, 0, 3, 3, 4, 5, 5, 3, 5, 3]