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.

A177186 a(n+1) = a(n) + p, where p is the largest prime dividing a(n) but not a(n-1), or 1 if there is no such prime.

Table of values

n a(n)
1 1
2 2
3 4
4 5
5 10
6 12
7 15
8 20
9 22
10 33
11 36
12 38
13 57
14 60
15 65
16 78
17 81
18 82
19 123
20 126
21 133
22 152
23 154
24 165
25 170
26 187
27 198
28 201
29 268
30 270
31 275
32 286
33 299
34 322
35 329
36 376
37 378
38 385
39 396
40 399
41 418
42 429
43 442
44 459
45 462
46 473
47 516
48 519
49 692
50 694
51 1041
52 1044
53 1073
54 1110
55 1115
56 1338

List of values

[1, 2, 4, 5, 10, 12, 15, 20, 22, 33, 36, 38, 57, 60, 65, 78, 81, 82, 123, 126, 133, 152, 154, 165, 170, 187, 198, 201, 268, 270, 275, 286, 299, 322, 329, 376, 378, 385, 396, 399, 418, 429, 442, 459, 462, 473, 516, 519, 692, 694, 1041, 1044, 1073, 1110, 1115, 1338]