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.

A076919 a(1) = 1, a(2) = 2, then a(n+1) is the smallest number such that the highest common factor of a(n) and a(n+1) is different from that of a(n) and a(n-1) and is more than 1.

Table of values

n a(n)
1 1
2 2
3 4
4 8
5 10
6 15
7 18
8 20
9 24
10 26
11 39
12 42
13 44
14 48
15 50
16 55
17 66
18 68
19 72
20 74
21 111
22 114
23 116
24 120
25 122
26 183
27 186
28 188
29 192
30 194
31 291
32 294
33 296
34 300
35 302
36 453
37 456
38 458
39 687
40 690
41 692
42 696
43 698
44 1047
45 1050
46 1052
47 1056
48 1058
49 1081
50 1128
51 1130
52 1135
53 1362
54 1364
55 1368
56 1370
57 1375
58 1386
59 1388
60 1392

List of values

[1, 2, 4, 8, 10, 15, 18, 20, 24, 26, 39, 42, 44, 48, 50, 55, 66, 68, 72, 74, 111, 114, 116, 120, 122, 183, 186, 188, 192, 194, 291, 294, 296, 300, 302, 453, 456, 458, 687, 690, 692, 696, 698, 1047, 1050, 1052, 1056, 1058, 1081, 1128, 1130, 1135, 1362, 1364, 1368, 1370, 1375, 1386, 1388, 1392]