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.

A194799 Triangle read by rows: T(n,k) = number of partitions of n that are formed by k sections, k >= 1.

Table of values

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

List of values

[1, 1, 1, 1, 1, 1, 2, 1, 1, 1, 2, 2, 1, 1, 1, 4, 2, 2, 1, 1, 1, 4, 4, 2, 2, 1, 1, 1, 7, 4, 4, 2, 2, 1, 1, 1, 8, 7, 4, 4, 2, 2, 1, 1, 1, 12, 8, 7, 4, 4, 2, 2, 1, 1, 1, 14, 12, 8, 7, 4, 4, 2, 2, 1, 1, 1, 21, 14, 12, 8, 7, 4, 4, 2, 2, 1, 1, 1, 24, 21, 14]