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.

A230399 Smallest k such that when k is divided by all numbers <= k the remainder n occurs most often.

Table of values

n a(n)
0 1
1 7
2 26
3 23
4 34
5 53
6 118
7 167
8 188
9 69
10 178
11 179
12 372
13 349
14 374
15 375
16 376
17 377
18 498
19 499
20 356
21 501
22 502
23 503
24 1284
25 1285
26 746
27 747
28 748
29 749
30 1038
31 1039
32 1112
33 753
34 754
35 755
36 2136
37 2137
38 2138
39 2139
40 2140
41 2141
42 2562
43 2443
44 1484
45 2445
46 1486
47 1487
48 2568
49 2569
50 2570
51 2571
52 2572
53 2573
54 2934
55 2575

List of values

[1, 7, 26, 23, 34, 53, 118, 167, 188, 69, 178, 179, 372, 349, 374, 375, 376, 377, 498, 499, 356, 501, 502, 503, 1284, 1285, 746, 747, 748, 749, 1038, 1039, 1112, 753, 754, 755, 2136, 2137, 2138, 2139, 2140, 2141, 2562, 2443, 1484, 2445, 1486, 1487, 2568, 2569, 2570, 2571, 2572, 2573, 2934, 2575]