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.

A154429 a(n) is the least k such that the greedy algorithm (for Egyptian fractions) on 4k/(24n+1) terminates in at most three steps.

Table of values

n a(n)
1 2
2 2
3 2
4 5
5 3
6 4
7 13
8 2
9 2
10 7
11 5
12 51
13 4
14 4
15 5
16 2
17 3
18 5
19 5
20 7
21 5
22 6
23 2
24 5
25 11
26 4
27 3
28 5
29 5
30 2
31 2
32 7
33 4
34 5
35 29
36 2
37 2
38 2
39 5
40 8
41 4
42 11
43 2
44 2
45 6
46 4
47 11
48 5
49 3
50 11
51 2
52 5
53 5
54 5
55 7
56 4
57 37
58 2
59 3
60 3
61 4
62 7
63 5
64 5
65 2
66 2
67 17
68 5
69 5
70 54
71 2
72 2
73 2
74 5
75 7
76 4
77 11
78 2
79 2
80 6
81 5
82 3
83 4
84 5
85 10
86 2
87 7
88 5
89 5
90 7
91 5
92 12
93 2
94 3
95 10
96 4
97 7
98 5
99 5
100 2

List of values

[2, 2, 2, 5, 3, 4, 13, 2, 2, 7, 5, 51, 4, 4, 5, 2, 3, 5, 5, 7, 5, 6, 2, 5, 11, 4, 3, 5, 5, 2, 2, 7, 4, 5, 29, 2, 2, 2, 5, 8, 4, 11, 2, 2, 6, 4, 11, 5, 3, 11, 2, 5, 5, 5, 7, 4, 37, 2, 3, 3, 4, 7, 5, 5, 2, 2, 17, 5, 5, 54, 2, 2, 2, 5, 7, 4, 11, 2, 2, 6, 5, 3, 4, 5, 10, 2, 7, 5, 5, 7, 5, 12, 2, 3, 10, 4, 7, 5, 5, 2]