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.

A345957 Number of divisors of n with exactly half as many prime factors as n, counting multiplicity.

Table of values

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

List of values

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

Started in 1964 by Neil J. A. Sloane | Maintained by The OEIS Foundation Inc.

Content is available under The OEIS End-User License Agreement.