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.

A338775 a(n+1) is the number of times a(n) is the least common multiple of one or more consecutive terms in this sequence so far with a(1) = 1.

Table of values

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

List of values

[1, 1, 3, 3, 7, 1, 4, 2, 1, 5, 2, 3, 8, 1, 6, 3, 9, 2, 4, 8, 5, 3, 10, 5, 4, 9, 3, 11, 1, 7, 4, 10, 7, 5, 5, 7, 6, 6, 8, 6, 9, 5, 8, 7, 7, 9, 6, 10, 8, 8, 10, 9, 7, 10, 10, 12, 1, 8, 12, 3, 12, 7, 11, 3, 13, 1, 9, 9, 12, 8, 13, 3, 14, 1, 10, 14, 3, 15, 3, 16, 1]