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.

A287957 Table read by antidiagonals: T(n, k) = greatest common recursive divisor of n and k; n > 0 and k > 0.

Table of values

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

List of values

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