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.

A085417 Take prime[n] and continue adding n,n+1,..., n+a(n)-1 until one reaches a prime.

Table of values

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

List of values

[1, 1, 3, 1, 3, 1, 3, 9, 3, 5, 3, 5, 3, 12, 4, 9, 3, 1, 3, 4, 3, 1, 4, 1, 7, 1, 7, 5, 3, 4, 3, 1, 3, 1, 3, 8, 3, 9, 7, 5, 4, 1, 8, 12, 4, 4, 15, 1, 8, 21, 3, 5, 24, 9, 12, 8, 3, 4, 3, 9, 11, 4, 3, 5, 48, 1, 7, 33, 3, 1, 3, 1, 15, 12, 3, 5, 8, 5, 3, 36, 19, 1, 3, 5, 11, 5, 12, 5, 4, 4, 3, 1, 3, 5, 3, 1, 15, 1]