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.

A060646 Bonse sequence: a(n) = minimal j such that n-j+1 < prime(j).

Table of values

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

List of values

[1, 2, 2, 3, 3, 3, 4, 4, 4, 5, 5, 5, 5, 5, 6, 6, 6, 7, 7, 7, 7, 7, 8, 8, 8, 9, 9, 9, 9, 9, 10, 10, 10, 10, 10, 10, 10, 11, 11, 11, 12, 12, 12, 12, 12, 12, 12, 13, 13, 13, 13, 13, 14, 14, 14, 15, 15, 15, 15, 15, 16, 16, 16, 16, 16, 16, 16, 17, 17, 17, 17, 17, 17, 17, 18, 18]

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

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