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.

A083912 Number of divisors of n that are congruent to 2 modulo 10.

Table of values

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

List of values

[0, 1, 0, 1, 0, 1, 0, 1, 0, 1, 0, 2, 0, 1, 0, 1, 0, 1, 0, 1, 0, 2, 0, 2, 0, 1, 0, 1, 0, 1, 0, 2, 0, 1, 0, 2, 0, 1, 0, 1, 0, 2, 0, 2, 0, 1, 0, 2, 0, 1, 0, 2, 0, 1, 0, 1, 0, 1, 0, 2, 0, 2, 0, 2, 0, 2, 0, 1, 0, 1, 0, 3, 0, 1, 0, 1, 0, 1, 0, 1, 0, 2, 0, 3, 0, 1, 0, 2, 0, 1, 0, 2, 0, 1, 0, 3, 0, 1, 0, 1, 0, 2, 0, 2, 0]