A339697 - cp's OEIS frontend

A339697 Square array T(n, k) read by antidiagonals, n >= 0 and k >= 0; 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)}; T(n, k) is the distance between g_n and g_k.

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

[0, 1, 1, 2, 0, 2, 2, 1, 1, 2, 3, 1, 0, 1, 3, 4, 2, 1, 1, 2, 4, 4, 3, 2, 0, 2, 3, 4, 3, 3, 3, 1, 1, 3, 3, 3, 4, 2, 2, 2, 0, 2, 2, 2, 4, 5, 3, 1, 2, 1, 1, 2, 1, 3, 5, 6, 4, 2, 2, 1, 0, 1, 2, 2, 4, 6, 6, 5, 3, 3, 2, 1, 1, 2, 3, 3, 5, 6, 6, 5, 4, 4, 3, 2, 0, 2, 3, 4, 4, 5, 6]

cp's OEIS Frontend

A339697 Square array T(n, k) read by antidiagonals, n >= 0 and k >= 0; 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)}; T(n, k) is the distance between g_n and g_k.

Table of values

List of values

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

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

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