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.

A261036 Table read by rows: number of complete partitions of n with largest part = k.

Table of values

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

List of values

[1, 1, 1, 1, 1, 1, 1, 2, 1, 1, 2, 2, 1, 3, 2, 2, 1, 3, 4, 2, 1, 4, 5, 4, 2, 1, 4, 6, 5, 4, 1, 5, 8, 8, 5, 4, 1, 5, 10, 10, 8, 5, 1, 6, 11, 14, 10, 8, 5, 1, 6, 14, 16, 16, 10, 8, 1, 7, 16, 22, 20, 16, 10, 8, 1, 7, 18, 26, 27, 20, 16, 10, 1, 8, 21, 32, 34, 31]