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.

A331886 T(n, k) is the least positive m such that floor(n/m) = floor(k/m). Square array T(n, k) read by antidiagonals, n >= 0 and k >= 0.

Table of values

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

List of values

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