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.

A094500 Least number k such that (n+1)^k / n^k >= 2.

Table of values

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

List of values

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

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

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