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.

A339695 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_{A006068(k)} is connected to g_{A006068(k+1)}; a(n) is the distance between g_0 and g_n.

Table of values

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

List of values

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