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.

A229724 Triangular array read by rows: T(n,k) is the number of partitions of n in which the greatest odd part is equal to 2k-1; n >= 1, 1 <= k <= ceiling(n/2).

Table of values

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

List of values

[1, 1, 2, 1, 2, 1, 4, 2, 1, 4, 3, 1, 7, 5, 2, 1, 7, 6, 3, 1, 12, 10, 5, 2, 1, 12, 12, 7, 3, 1, 19, 18, 11, 5, 2, 1, 19, 22, 14, 7, 3, 1, 30, 31, 21, 11, 5, 2, 1, 30, 37, 27, 15, 7, 3, 1, 45, 52, 38, 22, 11, 5, 2, 1, 45, 61, 48, 29, 15, 7, 3, 1, 67, 82, 66, 41]