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.

A178468 a(n) = smallest prime > a(n-1) such that a(n)+a(n-1) is multiple of k, a(1)=2, k=101.

Table of values

n a(n)
1 2
2 503
3 709
4 907
5 911
6 1109
7 2729
8 2927
9 3739
10 4139
11 4547
12 5351
13 5557
14 6361
15 6971
16 7573
17 7577
18 8179
19 10607
20 11411
21 11617
22 12421
23 12829
24 13229
25 14243
26 15451
27 15859
28 16057
29 16061
30 17471
31 19697
32 21107
33 21313
34 21713
35 22727
36 23531
37 26161
38 26561

List of values

[2, 503, 709, 907, 911, 1109, 2729, 2927, 3739, 4139, 4547, 5351, 5557, 6361, 6971, 7573, 7577, 8179, 10607, 11411, 11617, 12421, 12829, 13229, 14243, 15451, 15859, 16057, 16061, 17471, 19697, 21107, 21313, 21713, 22727, 23531, 26161, 26561]