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.

A096696 Consider the n-th prime, p_n, as the beginning of 2k+1 consecutive primes; then a(n) = p_(n+k) a balanced prime of order k, k maximized, or 0 if no such prime exists.

Table of values

n a(n)
1 0
2 5
3 29
4 37
5 0
6 0
7 0
8 0
9 0
10 149
11 53
12 0
13 53
14 71
15 137
16 227
17 0
18 0
19 89
20 79
21 0
22 0
23 0
24 0
25 179
26 0
27 0
28 173
29 173
30 0
31 0
32 419
33 0
34 157
35 0
36 157
37 173
38 0
39 173
40 0
41 263
42 0
43 0
44 0
45 0
46 211
47 229
48 0
49 353
50 397
51 0
52 0
53 353
54 359
55 409
56 577
57 0
58 353
59 383
60 353
61 0
62 0
63 0
64 0
65 0
66 0
67 349
68 349
69 0
70 0
71 0
72 397
73 373

List of values

[0, 5, 29, 37, 0, 0, 0, 0, 0, 149, 53, 0, 53, 71, 137, 227, 0, 0, 89, 79, 0, 0, 0, 0, 179, 0, 0, 173, 173, 0, 0, 419, 0, 157, 0, 157, 173, 0, 173, 0, 263, 0, 0, 0, 0, 211, 229, 0, 353, 397, 0, 0, 353, 359, 409, 577, 0, 353, 383, 353, 0, 0, 0, 0, 0, 0, 349, 349, 0, 0, 0, 397, 373]