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.

A211384 a(1) = 1, a(2) = 3; for n>2, a(n) = smallest number > a(n-1) such that a(n) is divisible by a(d) for all divisors d of n.

Table of values

n a(n)
1 1
2 3
3 4
4 6
5 7
6 12
7 13
8 18
9 20
10 21
11 22
12 24
13 25
14 39
15 56
16 72
17 73
18 120
19 121
20 126
21 156
22 198
23 199
24 216
25 217
26 225
27 240
28 312
29 313
30 336
31 337
32 360
33 396
34 438
35 455
36 480
37 481
38 726
39 800
40 882
41 883
42 936
43 937
44 990
45 1120
46 1194
47 1195
48 1296
49 1300
50 1302
51 1460
52 1800
53 1801
54 1920

List of values

[1, 3, 4, 6, 7, 12, 13, 18, 20, 21, 22, 24, 25, 39, 56, 72, 73, 120, 121, 126, 156, 198, 199, 216, 217, 225, 240, 312, 313, 336, 337, 360, 396, 438, 455, 480, 481, 726, 800, 882, 883, 936, 937, 990, 1120, 1194, 1195, 1296, 1300, 1302, 1460, 1800, 1801, 1920]