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.

A363444 a(n) = n for n <= 3; for n > 3, a(n) is the smallest positive number that has not yet appeared that includes as factors the distinct prime factors of a(n-2) and a(n-1) that are not shared between a(n-2) and a(n-1).

Table of values

n a(n)
1 1
2 2
3 3
4 6
5 4
6 9
7 12
8 8
9 15
10 30
11 10
12 18
13 45
14 20
15 24
16 60
17 5
18 36
19 90
20 25
21 42
22 210
23 35
24 48
25 420
26 70
27 21
28 120
29 140
30 63
31 150
32 280
33 84
34 75
35 350
36 126
37 105
38 40
39 168
40 315
41 50
42 252
43 525
44 80
45 294
46 630
47 55
48 462
49 840
50 110
51 231
52 1050
53 220
54 693
55 1260
56 330
57 77
58 1470
59 660
60 154
61 735
62 990
63 308
64 945
65 1320
66 616
67 1155

List of values

[1, 2, 3, 6, 4, 9, 12, 8, 15, 30, 10, 18, 45, 20, 24, 60, 5, 36, 90, 25, 42, 210, 35, 48, 420, 70, 21, 120, 140, 63, 150, 280, 84, 75, 350, 126, 105, 40, 168, 315, 50, 252, 525, 80, 294, 630, 55, 462, 840, 110, 231, 1050, 220, 693, 1260, 330, 77, 1470, 660, 154, 735, 990, 308, 945, 1320, 616, 1155]