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.

A027199 Triangular array T read by rows: T(n,k) = number of partitions of n into an odd number of parts, each >=k.

Table of values

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

List of values

[1, 1, 1, 2, 1, 1, 2, 1, 1, 1, 4, 1, 1, 1, 1, 5, 2, 1, 1, 1, 1, 8, 2, 1, 1, 1, 1, 1, 10, 3, 1, 1, 1, 1, 1, 1, 16, 4, 2, 1, 1, 1, 1, 1, 1, 20, 6, 2, 1, 1, 1, 1, 1, 1, 1, 29, 7, 3, 1, 1, 1, 1, 1, 1, 1, 1, 37, 10, 4, 2, 1, 1, 1, 1, 1, 1, 1, 1, 52, 12, 5, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 66, 17, 6, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]