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.

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

Table of values

n a(n)
1 1
2 1
3 1
4 3
5 6
6 8
7 10
8 15
9 21
10 28
11 32
12 41
13 45
14 55
15 66
16 78
17 91
18 98
19 113
20 128
21 136
22 153
23 171
24 190
25 210
26 231
27 242
28 265
29 288
30 313
31 325
32 351
33 378
34 406
35 435
36 465
37 496
38 512
39 545
40 578
41 613
42 648
43 666
44 703
45 741
46 780
47 820
48 861
49 903
50 946
51 968

List of values

[1, 1, 1, 3, 6, 8, 10, 15, 21, 28, 32, 41, 45, 55, 66, 78, 91, 98, 113, 128, 136, 153, 171, 190, 210, 231, 242, 265, 288, 313, 325, 351, 378, 406, 435, 465, 496, 512, 545, 578, 613, 648, 666, 703, 741, 780, 820, 861, 903, 946, 968]