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.

A179952 Add 1 to all the divisors of n. a(n) = number of perfect squares in the set.

Table of values

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

List of values

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