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.

A152157 Triangle read by rows: T(n,k) (n>=0, 0<=k<=n) = number of partitions of 2n+1 into 2k+1 odd parts.

Table of values

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

List of values

[1, 1, 1, 1, 1, 1, 1, 2, 1, 1, 1, 3, 2, 1, 1, 1, 4, 3, 2, 1, 1, 1, 5, 5, 3, 2, 1, 1, 1, 7, 7, 5, 3, 2, 1, 1, 1, 8, 10, 7, 5, 3, 2, 1, 1, 1, 10, 13, 11, 7, 5, 3, 2, 1, 1, 1, 12, 18, 15, 11, 7, 5, 3, 2, 1, 1, 1, 14, 23, 21, 15, 11, 7, 5, 3, 2, 1, 1, 1, 16, 30, 28, 22, 15, 11, 7, 5, 3, 2, 1, 1]