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.

A083218 a(n) = n mod (spf(n+1)+1), where spf(n) is the smallest prime factor of n (A020639).

Table of values

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

List of values

[1, 2, 0, 4, 2, 6, 1, 0, 0, 10, 2, 12, 1, 2, 0, 16, 2, 18, 1, 0, 0, 22, 2, 0, 1, 2, 0, 28, 2, 30, 1, 0, 0, 4, 2, 36, 1, 2, 0, 40, 2, 42, 1, 0, 0, 46, 2, 0, 1, 2, 0, 52, 2, 0, 1, 0, 0, 58, 2, 60, 1, 2, 0, 4, 2, 66, 1, 0, 0, 70, 2, 72, 1, 2, 0, 4, 2, 78, 1, 0, 0, 82, 2, 0, 1, 2, 0, 88, 2, 2, 1, 0, 0, 4, 2, 96]