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.

A207890 a(0)=1; for n>=1,- the minimal increasing sequence, such that, for n>=1, the row sums of Pascal-like triangle with left side {1,1,1,...} and right side {a(0), a(1), a(2),...} form an increasing sequence of primes.

Table of values

n a(n)
0 1
1 1
2 2
3 3
4 4
5 5
6 8
7 11
8 14
9 17
10 20
11 29
12 44
13 55
14 66
15 69
16 72
17 77
18 86
19 149
20 152
21 167
22 172
23 183
24 198
25 229
26 230
27 233
28 254
29 267
30 276
31 285
32 316
33 355
34 370
35 377
36 402
37 423
38 458
39 469
40 478
41 517
42 570
43 623
44 704
45 725
46 730
47 753
48 762
49 801
50 818
51 839
52 858
53 861
54 938
55 943
56 982

List of values

[1, 1, 2, 3, 4, 5, 8, 11, 14, 17, 20, 29, 44, 55, 66, 69, 72, 77, 86, 149, 152, 167, 172, 183, 198, 229, 230, 233, 254, 267, 276, 285, 316, 355, 370, 377, 402, 423, 458, 469, 478, 517, 570, 623, 704, 725, 730, 753, 762, 801, 818, 839, 858, 861, 938, 943, 982]