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.

A278950 Start with X = prime(n). Repeatedly replace X with X - ceiling(X/n); a(n) is the number of steps to reach a number <= ceiling(n*log(n)).

Table of values

n a(n)
2 1
3 1
4 1
5 1
6 1
7 1
8 1
9 1
10 2
11 2
12 2
13 2
14 2
15 2
16 2
17 3
18 2
19 3
20 3
21 3
22 3
23 3
24 3
25 4
26 4
27 4
28 4
29 3
30 3
31 5
32 5
33 5
34 5
35 6
36 5
37 6
38 6
39 6
40 6
41 6
42 6
43 7
44 6
45 6
46 5
47 7
48 8
49 8
50 7
51 7
52 7
53 6
54 7
55 8
56 8
57 8
58 7
59 8
60 7
61 7
62 8
63 9
64 9
65 9
66 8
67 10
68 10
69 11
70 11
71 10
72 11
73 11
74 11
75 11
76 11
77 11
78 11
79 11
80 12
81 12
82 12
83 13
84 12
85 12
86 12
87 12
88 12
89 12
90 11
91 11
92 12
93 13
94 12
95 13
96 12
97 13
98 13
99 13
100 15
101 15
102 16
103 16
104 16
105 15
106 15
107 16
108 16
109 16
110 15
111 15
112 15
113 15
114 14
115 15
116 16
117 15
118 15
119 15
120 15
121 14
122 15
123 15
124 15
125 16
126 16
127 16
128 17
129 18

List of values

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