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.

A173675 Let d_1, d_2, d_3, ..., d_tau(n) be the divisors of n; a(n) = number of permutations p of d_1, d_2, d_3, ..., d_tau(n) such that p_(i+1)/p_i is a prime or 1/prime for i = 1,2,...,tau(n)-1 and p_1 <= p_tau(n).

Table of values

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

List of values

[1, 1, 1, 1, 1, 4, 1, 1, 1, 4, 1, 8, 1, 4, 4, 1, 1, 8, 1, 8, 4, 4, 1, 14, 1, 4, 1, 8, 1, 72, 1, 1, 4, 4, 4, 20, 1, 4, 4, 14, 1, 72, 1, 8, 8, 4, 1, 22, 1, 8, 4, 8, 1, 14, 4, 14, 4, 4, 1, 584, 1, 4, 8, 1, 4, 72, 1, 8, 4, 72, 1, 62, 1, 4, 8, 8, 4, 72, 1, 22, 1, 4]