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.

A083919 Number of divisors of n that are congruent to 9 modulo 10.

Table of values

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

List of values

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