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.

A276426 Triangle read by rows: T(n,k) is the number of integer partitions of n having k distinct odd parts (n>=0).

Table of values

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

List of values

[1, 0, 1, 1, 1, 0, 3, 2, 2, 1, 0, 6, 1, 3, 5, 3, 0, 11, 4, 5, 8, 9, 0, 20, 9, 1, 7, 15, 19, 1, 0, 32, 21, 3, 11, 24, 38, 4, 0, 51, 41, 9, 15, 39, 69, 12, 0, 80, 73, 23, 22, 58, 123, 27, 1, 0, 119, 128, 49, 1, 30, 90, 202, 60, 3, 0, 175, 213, 98, 4, 42, 130, 328, 118, 9]