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.

A080063 a(n) = n mod (spf(n)+1), where spf(n) is the smallest prime dividing n (A020639).

Table of values

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

List of values

[1, 2, 3, 1, 5, 0, 7, 2, 1, 1, 11, 0, 13, 2, 3, 1, 17, 0, 19, 2, 1, 1, 23, 0, 1, 2, 3, 1, 29, 0, 31, 2, 1, 1, 5, 0, 37, 2, 3, 1, 41, 0, 43, 2, 1, 1, 47, 0, 1, 2, 3, 1, 53, 0, 1, 2, 1, 1, 59, 0, 61, 2, 3, 1, 5, 0, 67, 2, 1, 1, 71, 0, 73, 2, 3, 1, 5, 0, 79, 2, 1, 1, 83, 0, 1, 2, 3, 1, 89, 0, 3, 2, 1, 1, 5, 0]