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.

A291163 a(n) = smallest number k > a(n-1) maximizing the number of primes in all sums a(j)+k, j=1..(n-1), with a(1)=2.

Table of values

n a(n)
1 2
2 3
3 4
4 9
5 10
6 27
7 34
8 69
9 70
10 429
11 430
12 1059
13 1484
14 3537
15 8284
16 65169
17 98464
18 2061999
19 2210564
20 10919799
21 11521580
22 495385137
23 567955604
24 1112946057
25 4926960394
26 365847990027

List of values

[2, 3, 4, 9, 10, 27, 34, 69, 70, 429, 430, 1059, 1484, 3537, 8284, 65169, 98464, 2061999, 2210564, 10919799, 11521580, 495385137, 567955604, 1112946057, 4926960394, 365847990027]