cp's OEIS Frontend

This is a front-end for the Online Encyclopedia of Integer Sequences, made by Christian Perfect. The idea is to provide OEIS entries in non-ancient HTML, and then to think about how they're presented visually. The source code is on GitHub.

A386310 Number of divisors d of n such that 2*d^d == 0 (mod n).

Table of values

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

List of values

[1, 2, 1, 2, 1, 2, 1, 3, 2, 2, 1, 2, 1, 2, 1, 3, 1, 4, 1, 2, 1, 2, 1, 3, 2, 2, 3, 2, 1, 2, 1, 4, 1, 2, 1, 4, 1, 2, 1, 3, 1, 2, 1, 2, 2, 2, 1, 4, 2, 4, 1, 2, 1, 6, 1, 3, 1, 2, 1, 2, 1, 2, 2, 5, 1, 2, 1, 2, 1, 2, 1, 6, 1, 2, 2, 2, 1, 2, 1, 4, 3, 2, 1, 2, 1, 2, 1, 3, 1, 4, 1, 2, 1, 2, 1, 5, 1, 4, 2, 4]