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.

A174063 Triangular array (read by rows) containing the least n integers < 2n such that no integer divides another.

Table of values

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

List of values

[1, 2, 3, 2, 3, 5, 2, 3, 5, 7, 4, 5, 6, 7, 9, 4, 5, 6, 7, 9, 11, 4, 5, 6, 7, 9, 11, 13, 4, 6, 7, 9, 10, 11, 13, 15, 4, 6, 7, 9, 10, 11, 13, 15, 17, 4, 6, 7, 9, 10, 11, 13, 15, 17, 19, 4, 6, 9, 10, 11, 13, 14, 15, 17, 19, 21, 4, 6, 9, 10, 11, 13, 14, 15, 17, 19, 21, 23, 4, 6, 9, 10, 11, 13, 14]