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.

A113685 Triangular array read by rows: T(n,k) is the number of partitions of n in which sum of odd parts is k, for k=0,1,...,n; n>=0.

Table of values

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

List of values

[1, 0, 1, 1, 0, 1, 0, 1, 0, 2, 2, 0, 1, 0, 2, 0, 2, 0, 2, 0, 3, 3, 0, 2, 0, 2, 0, 4, 0, 3, 0, 4, 0, 3, 0, 5, 5, 0, 3, 0, 4, 0, 4, 0, 6, 0, 5, 0, 6, 0, 6, 0, 5, 0, 8, 7, 0, 5, 0, 6, 0, 8, 0, 6, 0, 10, 0, 7, 0, 10, 0, 9, 0, 10, 0, 8, 0, 12, 11, 0, 7, 0, 10, 0, 12, 0, 12, 0, 10, 0, 15, 0, 11, 0, 14, 0, 15, 0]