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.

A361825 a(1) = 1, a(2) = 2; for n > 2, 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-2) + a(n-1).

Table of values

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

List of values

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