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.

A338764 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) = K_n.

Table of values

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

List of values

[1, 1, 2, 3, 1, 3, 4, 5, 1, 5, 6, 7, 2, 7, 8, 9, 10, 3, 10, 11, 12, 1, 12, 3, 12, 13, 14, 15, 4, 15, 16, 17, 18, 5, 18, 19, 20, 21, 6, 1, 20, 21, 22, 23, 6, 23, 24, 25, 26, 7, 26, 2, 26, 27, 28, 7, 28, 29, 30, 31, 8, 31, 32, 33, 34, 9, 34, 35, 36, 37, 10, 37, 3]