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.

A214551 Reed Kelly's sequence: a(n) = (a(n-1) + a(n-3))/gcd(a(n-1), a(n-3)) with a(0) = a(1) = a(2) = 1.

Table of values

n a(n)
0 1
1 1
2 1
3 2
4 3
5 4
6 3
7 2
8 3
9 2
10 2
11 5
12 7
13 9
14 14
15 3
16 4
17 9
18 4
19 2
20 11
21 15
22 17
23 28
24 43
25 60
26 22
27 65
28 25
29 47
30 112
31 137
32 184
33 37
34 174
35 179
36 216
37 65
38 244
39 115
40 36
41 70
42 37
43 73
44 143
45 180
46 253
47 36
48 6
49 259
50 295
51 301
52 80
53 75
54 376
55 57
56 44
57 105
58 54
59 49
60 22
61 38
62 87
63 109
64 147

List of values

[1, 1, 1, 2, 3, 4, 3, 2, 3, 2, 2, 5, 7, 9, 14, 3, 4, 9, 4, 2, 11, 15, 17, 28, 43, 60, 22, 65, 25, 47, 112, 137, 184, 37, 174, 179, 216, 65, 244, 115, 36, 70, 37, 73, 143, 180, 253, 36, 6, 259, 295, 301, 80, 75, 376, 57, 44, 105, 54, 49, 22, 38, 87, 109, 147]

Started in 1964 by Neil J. A. Sloane | Maintained by The OEIS Foundation Inc.

Content is available under The OEIS End-User License Agreement.