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.

A083549 Quotient if least common multiple (lcm) of cototient values of consecutive integers is divided by the greatest common divisor (gcd) of the same pair of consecutive numbers.

Table of values

n a(n)
1 0
2 1
3 2
4 2
5 4
6 4
7 4
8 12
9 2
10 6
11 8
12 8
13 8
14 56
15 56
16 8
17 12
18 12
19 12
20 12
21 12
22 12
23 16
24 80
25 70
26 126
27 144
28 16
29 22
30 22
31 16
32 208
33 234
34 198
35 264
36 24
37 20
38 12
39 40
40 24
41 30
42 30
43 24
44 56
45 56
46 24
47 32
48 224
49 210
50 570
51 532
52 28
53 36
54 60
55 480
56 672
57 70
58 30
59 44
60 44
61 32
62 864
63 864
64 544
65 782
66 46
67 36
68 900

List of values

[0, 1, 2, 2, 4, 4, 4, 12, 2, 6, 8, 8, 8, 56, 56, 8, 12, 12, 12, 12, 12, 12, 16, 80, 70, 126, 144, 16, 22, 22, 16, 208, 234, 198, 264, 24, 20, 12, 40, 24, 30, 30, 24, 56, 56, 24, 32, 224, 210, 570, 532, 28, 36, 60, 480, 672, 70, 30, 44, 44, 32, 864, 864, 544, 782, 46, 36, 900]