A063781 - cp's OEIS frontend

A063781 a(n) is the number of pairs of integer quadruples (b_1, b_2, b_3, b_4) and (c_1, c_2, c_3, c_4) satisfying 1 <= b_1 < b_2 < b_3 < b_4 < n, 1 <= c_1 < c_2 < c_3 < c_4 < n, b_i != c_j for all i,j = 1,2,3,4 and Product_{i=1..4} sin(2Pib_i/n) = Product_{i=1..4} sin(2Pic_i/n).

n	a(n)
8	0
9	1
10	3
11	4
12	5
13	9
14	18
15	17
16	41
17	29
18	84
19	45
20	167
21	66
22	253
23	93
24	386
25	126
26	534
27	166
28	782
29	214
30	966
31	270
32	1380
33	335
34	1601
35	410
36	3053
37	495
38	2448
39	591
40	3135
41	699
42	3546
43	819
44	4785
45	952
46	4947
47	1099
48	8350
49	1260
50	6660
51	1436
52	8804
53	1628
54	8724
55	1836
56	10620
57	2061
58	11191

[0, 1, 3, 4, 5, 9, 18, 17, 41, 29, 84, 45, 167, 66, 253, 93, 386, 126, 534, 166, 782, 214, 966, 270, 1380, 335, 1601, 410, 3053, 495, 2448, 591, 3135, 699, 3546, 819, 4785, 952, 4947, 1099, 8350, 1260, 6660, 1436, 8804, 1628, 8724, 1836, 10620, 2061, 11191]

cp's OEIS Frontend

A063781 a(n) is the number of pairs of integer quadruples (b_1, b_2, b_3, b_4) and (c_1, c_2, c_3, c_4) satisfying 1 <= b_1 < b_2 < b_3 < b_4 < n, 1 <= c_1 < c_2 < c_3 < c_4 < n, b_i != c_j for all i,j = 1,2,3,4 and Product_{i=1..4} sin(2Pib_i/n) = Product_{i=1..4} sin(2Pic_i/n).

Table of values

List of values

cp's OEIS Frontend

A063781 a(n) is the number of pairs of integer quadruples (b_1, b_2, b_3, b_4) and (c_1, c_2, c_3, c_4) satisfying 1 <= b_1 < b_2 < b_3 < b_4 < n, 1 <= c_1 < c_2 < c_3 < c_4 < n, b_i != c_j for all i,j = 1,2,3,4 and Product_{i=1..4} sin(2*Pi*b_i/n) = Product_{i=1..4} sin(2*Pi*c_i/n).

Table of values

List of values

A063781 a(n) is the number of pairs of integer quadruples (b_1, b_2, b_3, b_4) and (c_1, c_2, c_3, c_4) satisfying 1 <= b_1 < b_2 < b_3 < b_4 < n, 1 <= c_1 < c_2 < c_3 < c_4 < n, b_i != c_j for all i,j = 1,2,3,4 and Product_{i=1..4} sin(2Pib_i/n) = Product_{i=1..4} sin(2Pic_i/n).