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.

A165430 Table T(n,m) read by rows: the greatest common unitary divisor of n and m, n>=1, 1<=m<=n.

Table of values

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

List of values

[1, 1, 2, 1, 1, 3, 1, 1, 1, 4, 1, 1, 1, 1, 5, 1, 2, 3, 1, 1, 6, 1, 1, 1, 1, 1, 1, 7, 1, 1, 1, 1, 1, 1, 1, 8, 1, 1, 1, 1, 1, 1, 1, 1, 9, 1, 2, 1, 1, 5, 2, 1, 1, 1, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 11, 1, 1, 3, 4, 1, 3, 1, 1, 1, 1, 1, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 13, 1, 2, 1, 1, 1, 2, 7, 1, 1, 2, 1, 1]