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.

A338763 Let L_1 = (1, 2, ...); for any n > 0, let M_n = Min_{k > 0} L_n(k) + L_n(k+1) and K_n = Min_{ k | L_n(k) + L_n(k+1) = M_n }, L_{n+1} is obtained by replacing the two terms L_n(K_n) and L_n(K_n+1) by M_n in L_n; a(n) = M_n.

Table of values

n a(n)
1 3
2 6
3 9
4 13
5 15
6 17
7 21
8 25
9 28
10 29
11 33
12 37
13 38
14 41
15 45
16 49
17 53
18 54
19 57
20 61
21 65
22 66
23 69
24 70
25 73
26 77
27 81
28 85
29 86
30 89
31 93
32 97
33 101
34 102
35 105
36 109
37 113
38 117
39 118
40 120
41 121
42 125
43 129
44 133
45 134
46 137
47 141
48 145
49 149
50 150
51 153
52 156
53 157
54 161
55 165
56 166
57 169
58 173
59 177

List of values

[3, 6, 9, 13, 15, 17, 21, 25, 28, 29, 33, 37, 38, 41, 45, 49, 53, 54, 57, 61, 65, 66, 69, 70, 73, 77, 81, 85, 86, 89, 93, 97, 101, 102, 105, 109, 113, 117, 118, 120, 121, 125, 129, 133, 134, 137, 141, 145, 149, 150, 153, 156, 157, 161, 165, 166, 169, 173, 177]