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.

A340607 Number of factorizations of n into an odd number of factors > 1, the greatest of which is odd.

Table of values

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

List of values

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