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.

A339696 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 number of nodes at distance n from g_0.

Table of values

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

List of values

[1, 1, 2, 2, 3, 3, 5, 3, 6, 7, 6, 5, 8, 9, 10, 5, 8, 10, 16, 12, 15, 12, 12, 7, 14, 18, 18, 16, 20, 17, 18, 7, 14, 18, 18, 17, 25, 29, 33, 21, 28, 30, 31, 22, 25, 24, 22, 11, 18, 24, 38, 31, 39, 35, 37, 25, 42, 46, 37, 29, 37, 33, 30, 11, 18, 24, 38, 31, 39, 35]