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.

A141059 Number of numbers m such that n = 0 (mod usigma(m)), where usigma(m) is the sum of unitary divisors of m (A034448).

Table of values

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

List of values

[1, 1, 2, 2, 2, 3, 1, 3, 3, 3, 1, 6, 1, 2, 3, 3, 2, 6, 1, 6, 2, 1, 1, 10, 2, 2, 3, 4, 1, 8, 1, 5, 3, 2, 2, 11, 1, 2, 2, 8, 1, 6, 1, 3, 4, 1, 1, 13, 1, 5, 3, 3, 1, 9, 2, 6, 2, 1, 1, 17, 1, 2, 3, 5, 3, 4, 1, 5, 2, 5, 1, 21, 1, 2, 3, 3, 1, 5, 1, 11, 3, 2, 1, 13, 3, 1, 2, 4, 1, 15, 1, 2, 2, 1, 2, 19, 1, 3, 4, 9, 1, 6]