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.

A026807 Triangular array T read by rows: T(n,k) = number of partitions of n in which every part is >=k, for k=1,2,...,n.

Table of values

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

List of values

[1, 2, 1, 3, 1, 1, 5, 2, 1, 1, 7, 2, 1, 1, 1, 11, 4, 2, 1, 1, 1, 15, 4, 2, 1, 1, 1, 1, 22, 7, 3, 2, 1, 1, 1, 1, 30, 8, 4, 2, 1, 1, 1, 1, 1, 42, 12, 5, 3, 2, 1, 1, 1, 1, 1, 56, 14, 6, 3, 2, 1, 1, 1, 1, 1, 1, 77, 21, 9, 5, 3, 2, 1, 1, 1, 1, 1, 1, 101, 24, 10, 5, 3, 2, 1, 1, 1, 1, 1, 1, 1, 135, 34, 13]