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.

A066032 Number of ways to write n as a product with no factor larger than m (1 <= m <=n, written row by row).

Table of values

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

List of values

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