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.

A365059 a(1) = 2; for n > 2, a(n) is the smallest positive number that has not yet appeared that is a multiple of A008472(a(n-1)), the sum of the distinct primes dividing a(n-1).

Table of values

n a(n)
1 2
2 4
3 6
4 5
5 10
6 7
7 14
8 9
9 3
10 12
11 15
12 8
13 16
14 18
15 20
16 21
17 30
18 40
19 28
20 27
21 24
22 25
23 35
24 36
25 45
26 32
27 22
28 13
29 26
30 60
31 50
32 42
33 48
34 55
35 64
36 34
37 19
38 38
39 63
40 70
41 56
42 54
43 65
44 72
45 75
46 80
47 49
48 77
49 90
50 100
51 84
52 96
53 85
54 44
55 39
56 112
57 81
58 33
59 98
60 99
61 126
62 108
63 95
64 120
65 110
66 144
67 105
68 135
69 88
70 52
71 150
72 130
73 140

List of values

[2, 4, 6, 5, 10, 7, 14, 9, 3, 12, 15, 8, 16, 18, 20, 21, 30, 40, 28, 27, 24, 25, 35, 36, 45, 32, 22, 13, 26, 60, 50, 42, 48, 55, 64, 34, 19, 38, 63, 70, 56, 54, 65, 72, 75, 80, 49, 77, 90, 100, 84, 96, 85, 44, 39, 112, 81, 33, 98, 99, 126, 108, 95, 120, 110, 144, 105, 135, 88, 52, 150, 130, 140]