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.

A132587 Let b(k) be the k-th term of the flattened irregular array where the m-th row contains the positive divisors of m. (b(k) = A027750(k).) Let c(k) be the k-th term of the flattened irregular array where the m-th row contains the positive integers that are <= m and are coprime to m. (c(k) = A038566(k).) Then a(n) = gcd(b(n),c(n)).

Table of values

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

List of values

[1, 1, 1, 1, 1, 1, 1, 2, 1, 1, 1, 1, 1, 2, 1, 1, 1, 2, 1, 1, 1, 1, 1, 1, 2, 5, 1, 1, 1, 1, 1, 3, 1, 2, 3, 1, 1, 1, 1, 1, 1, 1, 1, 5, 1, 1, 1, 2, 1, 4, 1, 1, 1, 2, 3, 2, 1, 6, 1, 1, 1, 1, 1, 1, 1, 2, 1, 1, 1, 1, 1, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 2, 3, 4, 1, 1, 1]