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.

A133266 a(1) = 30; for n >= 2, choose smallest a(n) so that no sum of 2 or more terms equals a prime.

Table of values

n a(n)
1 30
2 32
3 33
4 52
5 60
6 63
7 90
8 120
9 150
10 180
11 210
12 240
13 270
14 300
15 330
16 360
17 390
18 420
19 450
20 480
21 510
22 540
23 570
24 600
25 630
26 660
27 690
28 720
29 750
30 780

List of values

[30, 32, 33, 52, 60, 63, 90, 120, 150, 180, 210, 240, 270, 300, 330, 360, 390, 420, 450, 480, 510, 540, 570, 600, 630, 660, 690, 720, 750, 780]