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.

A075765 a(n) = floor(prime(n)/n) + (prime(n) mod n).

Table of values

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

List of values

[2, 2, 3, 4, 3, 3, 5, 5, 7, 11, 11, 4, 5, 4, 5, 8, 11, 10, 13, 14, 13, 16, 17, 20, 25, 26, 25, 26, 25, 26, 7, 7, 9, 7, 13, 11, 13, 15, 15, 17, 19, 17, 23, 21, 21, 19, 27, 35, 35, 33, 33, 35, 33, 39, 41, 43, 45, 43, 45, 45, 43, 49, 59, 59, 57, 57, 67, 69, 7, 73, 73, 75, 7, 8, 9, 8, 9, 12]

Started in 1964 by Neil J. A. Sloane | Maintained by The OEIS Foundation Inc.

Content is available under The OEIS End-User License Agreement.