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.

A281957 a(n) = largest k such that n has at least k partitions each containing at least k parts.

Table of values

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

List of values

[1, 1, 2, 2, 3, 4, 4, 5, 6, 7, 7, 8, 9, 10, 11, 12, 12, 13, 14, 15, 16, 17, 18, 19, 19, 20, 21, 22, 23, 24, 25, 26, 27, 28, 29, 30, 30, 31, 32, 33, 34, 35, 36, 37, 38, 39, 40, 41, 42, 43, 44, 45, 45, 46, 47, 48, 49, 50, 51, 52, 53, 54, 55, 56, 57, 58, 59, 60, 61]

Started in 1964 by Neil J. A. Sloane | Maintained by The OEIS Foundation Inc.

Content is available under The OEIS End-User License Agreement.