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.

A324831 Number of divisors d of n such that A323243(d) == 1 (mod 3).

Table of values

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

List of values

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