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.

A160752 a(n) is the number of sets of (distinct, not necessarily consecutive) positive divisors of n where each set has all of its elements in arithmetic progression, and where each set contains exactly A067131(n) elements.

Table of values

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

List of values

[1, 1, 1, 3, 1, 1, 1, 6, 3, 6, 1, 1, 1, 6, 1, 10, 1, 2, 1, 15, 6, 6, 1, 2, 3, 6, 6, 1, 1, 4, 1, 15, 6, 6, 6, 2, 1, 6, 6, 1, 1, 2, 1, 15, 3, 6, 1, 3, 3, 15, 6, 15, 1, 3, 6, 2, 6, 6, 1, 1, 1, 6, 15, 21, 6, 3, 1, 15, 6, 28, 1, 4, 1, 6, 2, 15, 6, 2, 1, 2, 10, 6, 1, 2, 6, 6, 6, 28, 1, 10, 1, 15, 6, 6, 6, 4, 1, 15]