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.

A079058 Least k > 0 such that A025591(k) >= p(n) (p(n)=the n-th partition number).

Table of values

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

List of values

[1, 3, 5, 6, 7, 8, 9, 9, 10, 11, 11, 12, 12, 13, 13, 14, 14, 14, 15, 15, 16, 16, 16, 17, 17, 18, 18, 18, 19, 19, 19, 20, 20, 20, 20, 21, 21, 21, 22, 22, 22, 22, 23, 23, 23, 24, 24, 24, 24, 25, 25, 25, 25, 26, 26, 26, 26, 27, 27, 27, 27, 28, 28, 28, 28, 28, 29, 29, 29, 29, 30, 30]

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

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