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.

A234541 Least k such that floor(n/k) + (n mod k) is a prime, or 0 if no such k exists.

Table of values

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

List of values

[0, 1, 1, 2, 1, 2, 1, 4, 2, 2, 1, 4, 1, 2, 3, 8, 1, 6, 1, 4, 2, 2, 1, 8, 2, 2, 5, 4, 1, 6, 1, 6, 2, 2, 3, 12, 1, 2, 3, 8, 1, 6, 1, 4, 2, 2, 1, 16, 3, 10, 3, 4, 1, 18, 3, 6, 2, 2, 1, 8, 1, 2, 6, 18, 3, 6, 1, 4, 3, 4, 1, 14, 1, 2, 9, 4, 5, 6, 1, 16, 2, 2, 1, 12, 2, 2]