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.

A369272 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 n*a(n-1).

Table of values

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

List of values

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