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.

A304752 Beginning with a(1) = 1, for n > 1, a(n) = the least divisor of a(n-1) not included earlier, otherwise a(n) = the least multiple m*a(n-1) such that m is not a divisor of a(n-1) and m*a(n-1) is not included earlier.

Table of values

n a(n)
1 1
2 2
3 6
4 3
5 12
6 4
7 20
8 5
9 10
10 30
11 15
12 60
13 420
14 7
15 14
16 42
17 21
18 84
19 28
20 140
21 35
22 70
23 210
24 105
25 630
26 9
27 18
28 72
29 8
30 24
31 120
32 40
33 240
34 16
35 48
36 336
37 56
38 168
39 840
40 280
41 1680
42 80
43 480
44 32
45 96
46 672
47 112
48 560
49 3360
50 160
51 960
52 64
53 192
54 1344
55 224
56 1120
57 6720
58 320
59 1920
60 128
61 384
62 2688
63 448
64 2240
65 13440
66 640
67 3840
68 256
69 768
70 5376
71 896
72 4480
73 26880
74 1280
75 7680
76 512

List of values

[1, 2, 6, 3, 12, 4, 20, 5, 10, 30, 15, 60, 420, 7, 14, 42, 21, 84, 28, 140, 35, 70, 210, 105, 630, 9, 18, 72, 8, 24, 120, 40, 240, 16, 48, 336, 56, 168, 840, 280, 1680, 80, 480, 32, 96, 672, 112, 560, 3360, 160, 960, 64, 192, 1344, 224, 1120, 6720, 320, 1920, 128, 384, 2688, 448, 2240, 13440, 640, 3840, 256, 768, 5376, 896, 4480, 26880, 1280, 7680, 512]