A206827 - cp's OEIS frontend

A206827 Number of solutions (n,k) of s(k) == s(n) (mod n), where 1 <= k < n and s(k) = k(k+1)(2*k+1)/6.

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

[1, 1, 1, 2, 2, 2, 1, 1, 3, 2, 2, 2, 3, 3, 1, 2, 1, 2, 3, 3, 3, 2, 1, 2, 3, 1, 3, 2, 3, 2, 1, 3, 3, 8, 1, 2, 3, 3, 3, 2, 4, 2, 3, 3, 3, 2, 2, 2, 3, 3, 3, 2, 2, 8, 3, 3, 3, 2, 2, 2, 3, 3, 1, 8, 3, 2, 3, 3, 9, 2, 1, 2, 3, 3, 3, 8, 2, 2, 3, 1, 3, 2, 4, 8, 3, 3, 3, 2, 5, 8, 3, 3, 3, 8, 2, 2, 3, 3, 3]

cp's OEIS Frontend

A206827 Number of solutions (n,k) of s(k) == s(n) (mod n), where 1 <= k < n and s(k) = k(k+1)(2*k+1)/6.

Table of values

List of values

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

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

cp's OEIS Frontend

A206827 Number of solutions (n,k) of s(k) == s(n) (mod n), where 1 <= k < n and s(k) = k*(k+1)*(2*k+1)/6.

Table of values

List of values

A206827 Number of solutions (n,k) of s(k) == s(n) (mod n), where 1 <= k < n and s(k) = k(k+1)(2*k+1)/6.

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