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.

A230374 The numbers n such that during dividing n by all positive integers not exceeding n the remainder 0 occurs most often.

Table of values

n a(n)
1 1
2 2
3 3
4 4
5 6
6 8
7 10
8 12
9 15
10 16
11 18
12 20
13 24
14 28
15 30
16 36
17 40
18 42
19 45
20 48
21 54
22 56
23 60
24 66
25 70
26 72
27 78
28 80
29 84
30 90
31 96
32 100
33 102
34 104
35 105
36 108
37 112
38 120
39 126
40 132
41 138
42 140
43 144
44 150
45 156
46 160
47 168
48 176
49 180
50 192
51 198
52 200
53 204
54 208
55 210
56 216
57 224
58 228
59 234
60 240
61 252

List of values

[1, 2, 3, 4, 6, 8, 10, 12, 15, 16, 18, 20, 24, 28, 30, 36, 40, 42, 45, 48, 54, 56, 60, 66, 70, 72, 78, 80, 84, 90, 96, 100, 102, 104, 105, 108, 112, 120, 126, 132, 138, 140, 144, 150, 156, 160, 168, 176, 180, 192, 198, 200, 204, 208, 210, 216, 224, 228, 234, 240, 252]

Started in 1964 by Neil J. A. Sloane | Maintained by The OEIS Foundation Inc.

Content is available under The OEIS End-User License Agreement.