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.

A351318 a(n) is the least prime prime(k), k > n, such that A036689(k) or A036690(k) is s(n) + s(n+1) + ... + s(j), j < k, where each s(i) is either A036689(i) or A036690(i).

Table of values

n a(n)
1 3
2 7
3 13
4 31
5 47
6 47
7 53
8 53
9 73
10 137
11 103
12 131
13 109
14 137
15 239
16 257
17 229
18 349
19 257
20 269
21 331
22 347
23 389
24 409
25 257
26 389
27 251
28 229
29 499
30 487
31 509
32 491
33 541
34 487
35 353
36 739
37 571
38 743
39 727
40 307
41 883
42 743
43 929
44 827
45 971
46 911
47 887
48 569
49 1063
50 751
51 1013
52 883
53 1451
54 977
55 1259
56 853
57 983
58 947
59 967
60 1049

List of values

[3, 7, 13, 31, 47, 47, 53, 53, 73, 137, 103, 131, 109, 137, 239, 257, 229, 349, 257, 269, 331, 347, 389, 409, 257, 389, 251, 229, 499, 487, 509, 491, 541, 487, 353, 739, 571, 743, 727, 307, 883, 743, 929, 827, 971, 911, 887, 569, 1063, 751, 1013, 883, 1451, 977, 1259, 853, 983, 947, 967, 1049]