A295557 - cp's OEIS frontend

A295557 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.

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

[1, 2, 2, 2, 2, 8, 2, 2, 2, 8, 2, 16, 2, 8, 8, 2, 2, 16, 2, 16, 8, 8, 2, 28, 2, 8, 2, 16, 2, 144, 2, 2, 8, 8, 8, 40, 2, 8, 8, 28, 2, 144, 2, 16, 16, 8, 2, 44, 2, 16, 8, 16, 2, 28, 8, 28, 8, 8, 2, 1168, 2, 8, 16, 2, 8, 144, 2, 16, 8, 144, 2, 124, 2, 8, 16, 16, 8, 144]

cp's OEIS Frontend

A295557 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.

Table of values

List of values