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.

A333716 a(0)=1; for n>0, a(n) is the greatest common divisor (GCD) of n and the sum of the previous terms back to the last GCD term, if the GCD is not already in the sequence; otherwise a(n) = a(n-1) + n.

Table of values

n a(n)
0 1
1 2
2 4
3 7
4 11
5 5
6 11
7 18
8 26
9 3
10 13
11 24
12 36
13 49
14 63
15 78
16 94
17 111
18 129
19 148
20 168
21 189
22 211
23 234
24 258
25 283
26 309
27 336
28 364
29 393
30 423
31 454
32 486
33 519
34 553
35 588
36 624
37 661
38 699
39 738
40 778
41 819
42 861
43 43
44 87
45 132
46 178
47 225
48 273
49 322
50 10
51 61
52 113
53 166
54 220
55 275
56 331
57 388
58 446
59 505
60 565

List of values

[1, 2, 4, 7, 11, 5, 11, 18, 26, 3, 13, 24, 36, 49, 63, 78, 94, 111, 129, 148, 168, 189, 211, 234, 258, 283, 309, 336, 364, 393, 423, 454, 486, 519, 553, 588, 624, 661, 699, 738, 778, 819, 861, 43, 87, 132, 178, 225, 273, 322, 10, 61, 113, 166, 220, 275, 331, 388, 446, 505, 565]