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.

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

Table of values

n a(n)
1 1
2 1
3 1
4 3
5 3
6 4
7 5
8 9
9 11
10 14
11 16
12 23
13 25
14 31
15 33
16 39
17 46
18 49
19 60
20 64
21 68
22 81
23 86
24 95
25 105
26 116
27 121
28 138
29 144
30 157
31 169
32 183
33 189
34 203
35 218
36 233
37 248
38 256
39 281
40 289
41 307
42 324
43 333
44 361
45 371
46 390
47 410
48 431
49 452
50 473
51 484
52 518
53 529

List of values

[1, 1, 1, 3, 3, 4, 5, 9, 11, 14, 16, 23, 25, 31, 33, 39, 46, 49, 60, 64, 68, 81, 86, 95, 105, 116, 121, 138, 144, 157, 169, 183, 189, 203, 218, 233, 248, 256, 281, 289, 307, 324, 333, 361, 371, 390, 410, 431, 452, 473, 484, 518, 529]