A339732 - cp's OEIS frontend

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

n	a(n)
0	1
1	1
2	2
3	3
4	5
5	6
6	8
7	11
8	15
9	17
10	28
11	39
12	48
13	64
14	94
15	116
16	164
17	217
18	289
19	395
20	542
21	729
22	919
23	1154
24	1598
25	2091
26	2747
27	3702
28	4867
29	6338
30	8290
31	10873
32	14533
33	18919
34	24577
35	31918
36	41857

[1, 1, 2, 3, 5, 6, 8, 11, 15, 17, 28, 39, 48, 64, 94, 116, 164, 217, 289, 395, 542, 729, 919, 1154, 1598, 2091, 2747, 3702, 4867, 6338, 8290, 10873, 14533, 18919, 24577, 31918, 41857]

cp's OEIS Frontend

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

Table of values

List of values