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.

A105120 a(1) = 2; k(1) = 0; for n > 1: k(n) = smallest number j >= k(n-1) such that 2*a(n-1) + j is prime; a(n) = 2*a(n-1) + k(n).

Table of values

n a(n)
1 2
2 5
3 11
4 23
5 47
6 97
7 197
8 397
9 797
10 1597
11 3203
12 6421
13 12889
14 25841
15 51749
16 103567
17 207227
18 414553
19 829211
20 1658533
21 3317177
22 6634469
23 13269059
24 26538257
25 53076679
26 106153547
27 212307299
28 424614829
29 849229907
30 1698460067
31 3396920419

List of values

[2, 5, 11, 23, 47, 97, 197, 397, 797, 1597, 3203, 6421, 12889, 25841, 51749, 103567, 207227, 414553, 829211, 1658533, 3317177, 6634469, 13269059, 26538257, 53076679, 106153547, 212307299, 424614829, 849229907, 1698460067, 3396920419]