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.

A097305 Array of number of partitions of n with odd parts only and largest part 2*m-1 with m in {1,2,..., ceiling(n/2)}.

Table of values

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

List of values

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