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.

A372368 a(1) = 1. Thereafter, if A007947(a(n-1)) is a term in A002110, a(n) is the smallest prime not already in the sequence. Otherwise a(n) is the smallest novel multiple of p, the greatest prime < g = gpd(a(n-1)).

Table of values

n a(n)
1 1
2 2
3 3
4 4
5 5
6 6
7 7
8 10
9 9
10 8
11 11
12 14
13 15
14 12
15 13
16 22
17 21
18 20
19 18
20 17
21 26
22 33
23 28
24 25
25 24
26 19
27 34
28 39
29 44
30 35
31 30
32 23
33 38
34 51
35 52
36 55
37 42
38 40
39 27
40 16
41 29
42 46
43 57
44 68
45 65
46 66
47 49
48 45
49 36
50 31
51 58
52 69
53 76
54 85
55 78
56 77
57 56
58 50
59 48
60 37
61 62
62 87
63 92
64 95
65 102
66 91
67 88
68 63

List of values

[1, 2, 3, 4, 5, 6, 7, 10, 9, 8, 11, 14, 15, 12, 13, 22, 21, 20, 18, 17, 26, 33, 28, 25, 24, 19, 34, 39, 44, 35, 30, 23, 38, 51, 52, 55, 42, 40, 27, 16, 29, 46, 57, 68, 65, 66, 49, 45, 36, 31, 58, 69, 76, 85, 78, 77, 56, 50, 48, 37, 62, 87, 92, 95, 102, 91, 88, 63]