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.

A331409 a(1)=1; for n>1, a(n) = a(n-1)+n, divided by its largest prime factor.

Table of values

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

List of values

[1, 1, 2, 2, 1, 1, 4, 4, 1, 1, 4, 8, 3, 1, 8, 8, 5, 1, 4, 8, 1, 1, 8, 16, 1, 9, 12, 8, 1, 1, 16, 16, 7, 1, 12, 16, 1, 3, 6, 2, 1, 1, 4, 16, 1, 1, 16, 32, 27, 7, 2, 18, 1, 5, 12, 4, 1, 1, 12, 24, 5, 1, 32, 32, 1, 1, 4, 24, 3, 1, 24, 32, 15, 1, 4, 16, 3, 27, 2, 2, 1, 1, 12, 32, 9]