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.

A327439 a(0)=1. If a(n-1) and n are relatively prime and a(n-1)!=1, a(n) = a(n-1) - 1. Otherwise (i.e., if a(n-1) and n share a common factor or a(n-1)=1), a(n) = a(n-1) + gcd(a(n-1),n) + 1.

Table of values

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

List of values

[1, 3, 2, 1, 3, 2, 5, 4, 9, 19, 18, 17, 16, 15, 14, 13, 12, 11, 10, 9, 8, 7, 6, 5, 4, 3, 2, 1, 3, 2, 5, 4, 9, 13, 12, 11, 10, 9, 8, 7, 6, 5, 4, 3, 2, 1, 3, 2, 5, 4, 7, 6, 9, 8, 11, 23, 22, 21, 20, 19, 18, 17, 16, 15, 14, 13, 12, 11]

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

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