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.

A339731 Let G be the undirected graph with nodes {g_k, k > 0} such that for any k > 0, g_k is connected to g_{k+1} and g_{A064413(k)} is connected to g_{A064413(k+1)}; a(n) is the distance between g_1 and g_n.

Table of values

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

List of values

[0, 1, 2, 2, 3, 3, 4, 4, 3, 4, 5, 4, 5, 5, 4, 5, 6, 5, 6, 6, 5, 6, 7, 6, 7, 6, 7, 7, 8, 8, 8, 7, 6, 7, 8, 7, 8, 7, 6, 7, 8, 8, 9, 8, 8, 8, 9, 9, 9, 8, 7, 8, 9, 9, 9, 8, 7, 8, 9, 10, 10, 9, 10, 10, 10, 10, 10, 9, 8, 9, 10, 10, 10, 9, 10, 11, 11, 11, 11, 10, 10]