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.

A230418 a(n) = the least k such that after having climbed k steps up from the root of the infinite trunk of the factorial beanstalk we have reached integer which is at least n.

Table of values

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

List of values

[0, 1, 2, 3, 3, 3, 4, 4, 5, 5, 5, 6, 6, 7, 7, 7, 7, 7, 8, 8, 8, 8, 8, 8, 9, 9, 10, 10, 10, 11, 11, 12, 12, 12, 12, 12, 13, 13, 13, 13, 13, 14, 14, 14, 14, 14, 14, 15, 15, 16, 16, 16, 16, 17, 17, 17, 17, 17, 18, 18, 18, 18, 18, 18, 19, 19, 19, 19, 19, 19, 19, 20, 20]