A353077 - cp's OEIS frontend

A353077 Triangle read by rows, where the n-th row consists of the lexicographically earliest solution for n integers in 0..p-1 whose n(n-1) differences are congruent to 1..p-1 (mod p), where p=n(n-1)+1. If no solution exists, the n-th row consists of n -1's.

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

[0, 0, 1, 0, 1, 3, 0, 1, 3, 9, 0, 1, 4, 14, 16, 0, 1, 3, 8, 12, 18, -1, -1, -1, -1, -1, -1, -1, 0, 1, 3, 13, 32, 36, 43, 52, 0, 1, 3, 7, 15, 31, 36, 54, 63, 0, 1, 3, 9, 27, 49, 56, 61, 77, 81, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, 0, 1, 3, 12, 20, 34, 38, 81, 88, 94, 104, 109]

cp's OEIS Frontend

A353077 Triangle read by rows, where the n-th row consists of the lexicographically earliest solution for n integers in 0..p-1 whose n(n-1) differences are congruent to 1..p-1 (mod p), where p=n(n-1)+1. If no solution exists, the n-th row consists of n -1's.

Table of values

List of values

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

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

cp's OEIS Frontend

A353077 Triangle read by rows, where the n-th row consists of the lexicographically earliest solution for n integers in 0..p-1 whose n*(n-1) differences are congruent to 1..p-1 (mod p), where p=n*(n-1)+1. If no solution exists, the n-th row consists of n -1's.

Table of values

List of values

A353077 Triangle read by rows, where the n-th row consists of the lexicographically earliest solution for n integers in 0..p-1 whose n(n-1) differences are congruent to 1..p-1 (mod p), where p=n(n-1)+1. If no solution exists, the n-th row consists of n -1's.

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