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.

A070221 a(n)=LPF(n+1)-LPF(n), where LPF(n) denotes the largest prime factor of n.

Table of values

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

List of values

[1, -1, 3, -2, 4, -5, 1, 2, 6, -8, 10, -6, -2, -3, 15, -14, 16, -14, 2, 4, 12, -20, 2, 8, -10, 4, 22, -24, 26, -29, 9, 6, -10, -4, 34, -18, -6, -8, 36, -34, 36, -32, -6, 18, 24, -44, 4, -2, 12, -4, 40, -50, 8, -4, 12, 10, 30, -54, 56, -30, -24, -5, 11, -2, 56, -50, 6, -16, 64, -68, 70, -36, -32, 14, -8, 2, 66, -74, -2, 38, 42, -76]