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.

A373083 a(1) = 1; for n > 1, a(n) = a(n-1) + n if n is prime, else a(n) = a(n-1) + largest divisor of n < n.

Table of values

n a(n)
1 1
2 3
3 6
4 8
5 13
6 16
7 23
8 27
9 30
10 35
11 46
12 52
13 65
14 72
15 77
16 85
17 102
18 111
19 130
20 140
21 147
22 158
23 181
24 193
25 198
26 211
27 220
28 234
29 263
30 278
31 309
32 325
33 336
34 353
35 360
36 378
37 415
38 434
39 447
40 467
41 508
42 529
43 572
44 594
45 609
46 632
47 679
48 703
49 710
50 735
51 752
52 778
53 831
54 858
55 869
56 897

List of values

[1, 3, 6, 8, 13, 16, 23, 27, 30, 35, 46, 52, 65, 72, 77, 85, 102, 111, 130, 140, 147, 158, 181, 193, 198, 211, 220, 234, 263, 278, 309, 325, 336, 353, 360, 378, 415, 434, 447, 467, 508, 529, 572, 594, 609, 632, 679, 703, 710, 735, 752, 778, 831, 858, 869, 897]