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.

A357777 a(1)=1, a(2)=2. Thereafter a(n+1) is the smallest k such that gcd(k, a(n)) > 1, and gcd(k, s(n)) = 1, where s(n) is the n-th partial sum.

Table of values

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

List of values

[1, 2, 4, 6, 3, 9, 12, 8, 14, 7, 35, 5, 15, 10, 16, 20, 18, 21, 27, 24, 22, 11, 33, 30, 25, 55, 40, 26, 13, 39, 36, 28, 32, 34, 17, 51, 45, 57, 19, 133, 38, 44, 46, 23, 69, 42, 48, 50, 52, 54, 56, 49, 63, 60, 58, 29, 87, 66, 62, 31, 93, 72, 64, 68, 70, 65, 75, 78]

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

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