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.

A351495 a(1) = 1, for n > 1, a(n) is the smallest positive number that has not yet appeared that is a multiple of the smallest prime that does not divide a(n-1).

Table of values

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

List of values

[1, 2, 3, 4, 6, 5, 8, 9, 10, 12, 15, 14, 18, 20, 21, 16, 24, 25, 22, 27, 26, 30, 7, 28, 33, 32, 36, 35, 34, 39, 38, 42, 40, 45, 44, 48, 50, 51, 46, 54, 55, 52, 57, 56, 60, 49, 58, 63, 62, 66, 65, 64, 69, 68, 72, 70, 75, 74, 78, 80, 81, 76, 84, 85, 82, 87, 86, 90, 77, 88, 93, 92, 96, 95, 94]