A289905 - cp's OEIS frontend

A289905 Square array T(n,k) (n>0, k>0) read by antidiagonals: if gcd(n,k)>1 then T(n,k)=-1, otherwise T(n,k) = the unique m such that A289815(m) = n and A289816(m) = k.

n	a(n)
1	0
2	1
3	2
4	3
5	-1
6	6
7	9
8	5
9	7
10	18
11	27
12	-1
13	-1
14	-1
15	54
16	4
17	11
18	15
19	21
20	19
21	8
22	81
23	-1
24	33
25	-1
26	57
27	-1
28	162
29	243
30	29
31	-1
32	45
33	63
34	-1
35	55
36	486
37	729
38	-1
39	87
40	-1
41	-1
42	-1
43	165
44	-1
45	1458
46	10
47	83
48	249
49	99
50	22
51	17
52	171
53	489
54	163
55	20
56	2187
57	-1
58	-1
59	-1
60	135
61	-1
62	189
63	-1
64	-1

[0, 1, 2, 3, -1, 6, 9, 5, 7, 18, 27, -1, -1, -1, 54, 4, 11, 15, 21, 19, 8, 81, -1, 33, -1, 57, -1, 162, 243, 29, -1, 45, 63, -1, 55, 486, 729, -1, 87, -1, -1, -1, 165, -1, 1458, 10, 83, 249, 99, 22, 17, 171, 489, 163, 20, 2187, -1, -1, -1, 135, -1, 189, -1, -1]

cp's OEIS Frontend

A289905 Square array T(n,k) (n>0, k>0) read by antidiagonals: if gcd(n,k)>1 then T(n,k)=-1, otherwise T(n,k) = the unique m such that A289815(m) = n and A289816(m) = k.

Table of values

List of values