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.

A116664 Triangle read by rows: T(n,k) is the number of partitions of n into odd parts and having exactly k parts that appear exactly once (n>=0, k>=0).

Table of values

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

List of values

[1, 0, 1, 1, 0, 1, 1, 1, 0, 1, 1, 2, 0, 2, 1, 1, 1, 4, 0, 2, 2, 2, 3, 4, 0, 1, 3, 4, 3, 0, 3, 7, 1, 1, 5, 4, 6, 0, 4, 10, 2, 2, 6, 7, 9, 0, 7, 12, 5, 3, 7, 13, 11, 0, 1, 8, 18, 7, 5, 0, 11, 15, 18, 1, 1, 10, 25, 11, 8, 0, 13, 23, 24, 2, 2, 15, 32, 16, 13, 0, 16, 33, 32, 5, 3, 18, 43, 24, 19, 0, 23, 40]