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.

A264398 Triangle read by rows: T(n,k) is the number of partitions of n having k parts with odd multiplicities.

Table of values

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

List of values

[1, 0, 1, 1, 1, 0, 2, 1, 2, 2, 1, 0, 4, 3, 3, 4, 3, 1, 0, 7, 7, 1, 5, 7, 7, 3, 0, 12, 14, 4, 7, 12, 14, 8, 1, 0, 19, 26, 10, 1, 11, 19, 26, 18, 3, 0, 30, 45, 22, 4, 15, 30, 45, 36, 9, 0, 45, 75, 44, 11, 1, 22, 45, 75, 67, 21, 1, 0, 67, 120, 81, 26, 3, 30, 67, 120, 119, 45, 4]