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.

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

Table of values

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

List of values

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