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.

A233322 Triangle read by rows: T(n,k) = number of palindromic partitions of n in which no part exceeds k, 1 <= k <= n.

Table of values

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

List of values

[1, 1, 2, 1, 1, 2, 1, 3, 3, 4, 1, 2, 3, 3, 4, 1, 4, 5, 6, 6, 7, 1, 2, 5, 5, 6, 6, 7, 1, 5, 7, 10, 10, 11, 11, 12, 1, 3, 7, 8, 10, 10, 11, 11, 12, 1, 6, 9, 14, 15, 17, 17, 18, 18, 19, 1, 3, 9, 11, 15, 15, 17, 17, 18, 18, 19, 1, 7, 12, 20, 22, 26, 26, 28, 28, 29, 29, 30]