A345417 - cp's OEIS frontend

A345417 Table read by upward antidiagonals: Given m, n >= 1, write gcd(prime(m),prime(n)) as d = uprime(m)+vprime(n) where u, v are minimal; T(m,n) = u.

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

[0, 1, -1, 1, 0, -2, 1, -1, 2, -3, 1, 1, 0, -2, -5, 1, -1, -2, 3, 4, -6, 1, 1, 1, 0, -2, -4, -8, 1, -1, 2, 2, -3, -5, 6, -9, 1, 1, -2, -1, 0, 2, 7, -6, -11, 1, -1, -1, -2, -5, 6, 5, 4, 8, -14, 1, -1, 2, 3, 2, 0, -3, -8, -9, 10, -15, 1, 1, -1, -3, -4, -3, 4, 7, 10, 6, -10, -18]

cp's OEIS Frontend

A345417 Table read by upward antidiagonals: Given m, n >= 1, write gcd(prime(m),prime(n)) as d = uprime(m)+vprime(n) where u, v are minimal; T(m,n) = u.

Table of values

List of values

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

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

cp's OEIS Frontend

A345417 Table read by upward antidiagonals: Given m, n >= 1, write gcd(prime(m),prime(n)) as d = u*prime(m)+v*prime(n) where u, v are minimal; T(m,n) = u.

Table of values

List of values

A345417 Table read by upward antidiagonals: Given m, n >= 1, write gcd(prime(m),prime(n)) as d = uprime(m)+vprime(n) where u, v are minimal; T(m,n) = u.

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