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.

A060448 Each c(i) is "multiply" (*) or "divide" (/); d(1) = 1 < d(2) < ... < d(m) = n are the divisors of n; a(n) is number of choices for c(1), ..., c(m-1) so that d(1) c(1) d(2) c(2) d(3), .., c(m-1) d(m) is an integer.

Table of values

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

List of values

[1, 1, 1, 2, 1, 5, 1, 5, 2, 5, 1, 13, 1, 5, 5, 9, 1, 13, 1, 13, 5, 5, 1, 62, 2, 5, 5, 13, 1, 59, 1, 16, 5, 5, 5, 90, 1, 5, 5, 62, 1, 59, 1, 13, 13, 5, 1, 192, 2, 13, 5, 13, 1, 62, 5, 62, 5, 5, 1, 817, 1, 5, 13, 32, 5, 59, 1, 13, 5, 59, 1, 885, 1, 5, 13, 13, 5, 59, 1, 192, 9, 5, 1, 817, 5, 5]