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.

A069890 Smallest odd number k such that p(2m)-2p(m)=k has exactly n solutions (where p(m) = m-th prime).

Table of values

n a(n)
0 23
1 1
2 19
3 15
4 209
5 433
6 657
7 135
8 435
9 2715
10 9525
11 9639
12 20757
13 20493
14 4389
15 47025
16 27555
17 193875
18 162435
19 51405
20 811497
21 764547
22 832995
23 811485
24 811515
25 193755
26 1233309
27 811473
28 15680805
29 4247325
30 10797675
31 12945345
32 15391761

List of values

[23, 1, 19, 15, 209, 433, 657, 135, 435, 2715, 9525, 9639, 20757, 20493, 4389, 47025, 27555, 193875, 162435, 51405, 811497, 764547, 832995, 811485, 811515, 193755, 1233309, 811473, 15680805, 4247325, 10797675, 12945345, 15391761]