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.

A260966 a(0)=1, then a(n) is the least sum of two successive primes that is a multiple of n and > a(n-1).

Table of values

n a(n)
0 1
1 5
2 8
3 12
4 24
5 30
6 36
7 42
8 112
9 144
10 210
11 308
12 360
13 390
14 434
15 450
16 480
17 918
18 990
19 1064
20 1120
21 1428
22 1518
23 1656
24 1848
25 1900
26 2132
27 2430
28 2604
29 2610
30 2640
31 2728
32 2912
33 2970
34 2992
35 3010
36 3240
37 3330
38 3952
39 4056
40 4680
41 5740
42 6090
43 6450
44 6600
45 6660
46 6762
47 7990
48 8256
49 8428
50 9000
51 9282
52 9308

List of values

[1, 5, 8, 12, 24, 30, 36, 42, 112, 144, 210, 308, 360, 390, 434, 450, 480, 918, 990, 1064, 1120, 1428, 1518, 1656, 1848, 1900, 2132, 2430, 2604, 2610, 2640, 2728, 2912, 2970, 2992, 3010, 3240, 3330, 3952, 4056, 4680, 5740, 6090, 6450, 6600, 6660, 6762, 7990, 8256, 8428, 9000, 9282, 9308]