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.

A363709 For n >= 0, a(n) is the least integer i >= 0 such that n + (n + 1) + ... + (n + i) is a prime number or a(n) = -1 if no such i exists.

Table of values

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

List of values

[2, 1, 0, 0, -1, 0, 1, 0, 1, 1, -1, 0, -1, 0, 1, 1, -1, 0, 1, 0, 1, 1, -1, 0, -1, -1, 1, -1, -1, 0, 1, 0, -1, 1, -1, 1, 1, 0, -1, 1, -1, 0, -1, 0, 1, -1, -1, 0, 1, -1, 1, 1, -1, 0, 1, -1, 1, -1, -1, 0, -1, 0, -1, 1, -1, 1, -1, 0, 1, 1, -1, 0, -1, 0, 1, 1, -1, -1, 1, 0, -1]