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.

A236293 Triangular array T: T(n,1) = number of constant partitions of n; T(n,k) = number of nonconstant partitions of n that have length k, for k = 2..n-1, for n >= 2.

Table of values

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

List of values

[1, 2, 2, 1, 3, 1, 1, 2, 2, 2, 1, 4, 2, 2, 2, 1, 2, 3, 4, 3, 2, 1, 4, 3, 5, 4, 3, 2, 1, 3, 4, 6, 6, 5, 3, 2, 1, 4, 4, 8, 9, 6, 5, 3, 2, 1, 2, 5, 10, 11, 10, 7, 5, 3, 2, 1, 6, 5, 11, 14, 13, 10, 7, 5, 3, 2, 1, 2, 6, 14, 18, 18, 14, 11, 7, 5, 3, 2, 1, 4, 6, 16]