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.

A101257 Remainder when the least divisor of n greater than or equal to the square root of n (A033677(n)) is divided by the greatest divisor of n less than or equal to the square root of n (A033676(n)).

Table of values

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

List of values

[0, 0, 0, 0, 0, 1, 0, 0, 0, 1, 0, 1, 0, 1, 2, 0, 0, 0, 0, 1, 1, 1, 0, 2, 0, 1, 0, 3, 0, 1, 0, 0, 2, 1, 2, 0, 0, 1, 1, 3, 0, 1, 0, 3, 4, 1, 0, 2, 0, 0, 2, 1, 0, 3, 1, 1, 1, 1, 0, 4, 0, 1, 2, 0, 3, 5, 0, 1, 2, 3, 0, 1, 0, 1, 0, 3, 4, 1, 0, 2, 0, 1, 0, 5, 2, 1, 2, 3, 0, 1, 6, 3, 1, 1, 4, 4, 0, 0, 2, 0, 0, 5, 0, 5, 1]