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.

A043550 Least k for which the integers floor(3*k/m) for m=2,3,...,n are distinct.

Table of values

n a(n)
1 1
2 1
3 2
4 2
5 3
6 7
7 9
8 10
9 14
10 19
11 24
12 27
13 30
14 37
15 44
16 52
17 61
18 70
19 75
20 86
21 97
22 102
23 114
24 127
25 140
26 147
27 169
28 177
29 192
30 209
31 226
32 234
33 252
34 271
35 290
36 310
37 331
38 352
39 363
40 386
41 409
42 432
43 444
44 469
45 494
46 520
47 547
48 574
49 602
50 631
51 660
52 675

List of values

[1, 1, 2, 2, 3, 7, 9, 10, 14, 19, 24, 27, 30, 37, 44, 52, 61, 70, 75, 86, 97, 102, 114, 127, 140, 147, 169, 177, 192, 209, 226, 234, 252, 271, 290, 310, 331, 352, 363, 386, 409, 432, 444, 469, 494, 520, 547, 574, 602, 631, 660, 675]