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.

A097306 Array of number of partitions of n with odd parts not exceeding 2*m-1 with m in {1, 2, ..., ceiling(n/2)}.

Table of values

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

List of values

[1, 1, 1, 2, 1, 2, 1, 2, 3, 1, 3, 4, 1, 3, 4, 5, 1, 3, 5, 6, 1, 4, 6, 7, 8, 1, 4, 7, 9, 10, 1, 4, 8, 10, 11, 12, 1, 5, 9, 12, 14, 15, 1, 5, 10, 14, 16, 17, 18, 1, 5, 11, 16, 19, 21, 22, 1, 6, 13, 19, 23, 25, 26, 27, 1, 6, 14, 21, 26, 29, 31, 32, 1, 6, 15, 24, 30, 34, 36, 37, 38, 1, 7, 17, 27]