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.

A243987 Triangle read by rows: T(n, k) is the number of divisors of n that are less than or equal to k for 1 <= k <= n.

Table of values

n a(n)
1 1
2 1
3 2
4 1
5 1
6 2
7 1
8 2
9 2
10 3
11 1
12 1
13 1
14 1
15 2
16 1
17 2
18 3
19 3
20 3
21 4
22 1
23 1
24 1
25 1
26 1
27 1
28 2
29 1
30 2
31 2
32 3
33 3
34 3
35 3
36 4
37 1
38 1
39 2
40 2
41 2
42 2
43 2
44 2
45 3
46 1
47 2
48 2
49 2
50 3
51 3
52 3
53 3
54 3
55 4
56 1
57 1
58 1
59 1
60 1
61 1
62 1
63 1
64 1
65 1
66 2
67 1
68 2
69 3
70 4
71 4
72 5
73 5
74 5
75 5
76 5
77 5
78 6
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 2
92 1
93 2
94 2
95 2
96 2
97 2
98 3
99 3
100 3
101 3
102 3
103 3
104 3
105 4
106 1
107 1
108 2
109 2
110 3
111 3
112 3
113 3
114 3
115 3
116 3
117 3
118 3
119 3
120 4

List of values

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