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.

A337182 a(1) = 1, a(2) = 2; for n>2, a(n) is the smallest number not already used which is a multiple of the product of the most frequently occurring distinct prime factors in a(n-1).

Table of values

n a(n)
1 1
2 2
3 4
4 6
5 12
6 8
7 10
8 20
9 14
10 28
11 16
12 18
13 3
14 9
15 15
16 30
17 60
18 22
19 44
20 24
21 26
22 52
23 32
24 34
25 68
26 36
27 42
28 84
29 38
30 76
31 40
32 46
33 92
34 48
35 50
36 5
37 25
38 35
39 70
40 140
41 54
42 21
43 63
44 27
45 33
46 66
47 132
48 56
49 58
50 116
51 62
52 124
53 64
54 72
55 74
56 148
57 78
58 156
59 80
60 82
61 164
62 86
63 172
64 88
65 90
66 39
67 117
68 45
69 51
70 102
71 204

List of values

[1, 2, 4, 6, 12, 8, 10, 20, 14, 28, 16, 18, 3, 9, 15, 30, 60, 22, 44, 24, 26, 52, 32, 34, 68, 36, 42, 84, 38, 76, 40, 46, 92, 48, 50, 5, 25, 35, 70, 140, 54, 21, 63, 27, 33, 66, 132, 56, 58, 116, 62, 124, 64, 72, 74, 148, 78, 156, 80, 82, 164, 86, 172, 88, 90, 39, 117, 45, 51, 102, 204]