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.

A327562 a(0) = a(1) = 1; for n > 1, a(n) = (a(n-1) + a(n-2)) / gcd(a(n-1), a(n-2)) if a(n-1) and a(n-2) are not coprime, otherwise a(n) = a(n-1) + a(n-2) + 1.

Table of values

n a(n)
0 1
1 1
2 3
3 5
4 9
5 15
6 8
7 24
8 4
9 7
10 12
11 20
12 8
13 7
14 16
15 24
16 5
17 30
18 7
19 38
20 46
21 42
22 44
23 43
24 88
25 132
26 5
27 138
28 144
29 47
30 192
31 240
32 9
33 83
34 93
35 177
36 90
37 89
38 180
39 270
40 5
41 55
42 12
43 68
44 20
45 22
46 21
47 44
48 66
49 5
50 72
51 78
52 25
53 104
54 130
55 9
56 140
57 150
58 29
59 180
60 210
61 13
62 224
63 238
64 33
65 272
66 306

List of values

[1, 1, 3, 5, 9, 15, 8, 24, 4, 7, 12, 20, 8, 7, 16, 24, 5, 30, 7, 38, 46, 42, 44, 43, 88, 132, 5, 138, 144, 47, 192, 240, 9, 83, 93, 177, 90, 89, 180, 270, 5, 55, 12, 68, 20, 22, 21, 44, 66, 5, 72, 78, 25, 104, 130, 9, 140, 150, 29, 180, 210, 13, 224, 238, 33, 272, 306]