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.

A116675 Triangle read by rows: T(n,k) is the number of partitions of n into distinct part and having exactly k odd parts (n>=0, k>=0).

Table of values

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

List of values

[1, 0, 1, 1, 0, 0, 2, 1, 0, 1, 0, 3, 0, 2, 0, 2, 0, 5, 0, 2, 0, 4, 0, 7, 0, 1, 3, 0, 7, 0, 0, 10, 0, 2, 4, 0, 11, 0, 0, 14, 0, 4, 5, 0, 17, 0, 0, 19, 0, 8, 6, 0, 25, 0, 1, 0, 25, 0, 13, 0, 8, 0, 36, 0, 2, 0, 33, 0, 21, 0, 10, 0, 50, 0, 4, 0, 43, 0, 33, 0, 12, 0, 69, 0, 8, 0, 55, 0, 49, 0, 15, 0, 93, 0, 14]