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.

A357735 a(1)=1, a(2)=2. Thereafter a(n+1) is least k != partial sum s(n) which has not occurred earlier, such that gcd(k, s(n)) > 1.

Table of values

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

List of values

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