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.

A026820 Euler's table: triangular array T read by rows, where T(n,k) = number of partitions in which every part is <= k for 1 <= k <= n. Also number of partitions of n into at most k parts.

Table of values

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

List of values

[1, 1, 2, 1, 2, 3, 1, 3, 4, 5, 1, 3, 5, 6, 7, 1, 4, 7, 9, 10, 11, 1, 4, 8, 11, 13, 14, 15, 1, 5, 10, 15, 18, 20, 21, 22, 1, 5, 12, 18, 23, 26, 28, 29, 30, 1, 6, 14, 23, 30, 35, 38, 40, 41, 42, 1, 6, 16, 27, 37, 44, 49, 52, 54, 55, 56, 1, 7, 19, 34, 47, 58, 65, 70, 73, 75, 76, 77]