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.

A362267 For n >= 0, a(n) is the least integer i >= 0 such that n + p_1 + ... + p_i = q, q prime number, or a(n) = -1 if no such i exists. Here p_1 is the least prime >= n, p_1 < p_2 < ... < p_i are prime numbers (A000040).

Table of values

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

List of values

[1, 1, 0, 0, 15, 0, 1, 0, 1, 12, 13, 0, 3, 0, 1, 4, 29, 1, 1, 0, 1, 2, 25, 0, 1, 4, 7, 8, 13, 0, 1, 0, 7, 6, 1, 2, 1, 0, 1, 4, 21, 0, 7, 0, 5, 10, 19, 0, 1, 6, 1, 2, 85, 0, 1, 4, 17, 6, 5, 0, 11, 0, 15, 4, 1, 20, 3, 0, 1, 14, 3, 0, 3, 0, 5, 22, 17, 2, 1, 0, 1, 6, 11, 0]