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.

A224229 a(0)=2; for n>0, a(n) = smallest prime not occurring earlier in the sequence such that a(n-1)+a(n) is a multiple of floor(sqrt(n)). If no such prime exists, the sequence terminates.

Table of values

n a(n)
0 2
1 3
2 5
3 7
4 11
5 13
6 17
7 19
8 23
9 31
10 29
11 37
12 41
13 43
14 47
15 61
16 59
17 53
18 67
19 73
20 71
21 89
22 79
23 97
24 83
25 107
26 103
27 127
28 113
29 137
30 163
31 157
32 173
33 167
34 193
35 197
36 109
37 101
38 139
39 131
40 151
41 149
42 181
43 179
44 199
45 191
46 211
47 227
48 223
49 239
50 251
51 281
52 293
53 337
54 307
55 379
56 349
57 421
58 419
59 449
60 433
61 463
62 461
63 491
64 229
65 283
66 269
67 331
68 277
69 347
70 317
71 443
72 373
73 467
74 389
75 499
76 397
77 523

List of values

[2, 3, 5, 7, 11, 13, 17, 19, 23, 31, 29, 37, 41, 43, 47, 61, 59, 53, 67, 73, 71, 89, 79, 97, 83, 107, 103, 127, 113, 137, 163, 157, 173, 167, 193, 197, 109, 101, 139, 131, 151, 149, 181, 179, 199, 191, 211, 227, 223, 239, 251, 281, 293, 337, 307, 379, 349, 421, 419, 449, 433, 463, 461, 491, 229, 283, 269, 331, 277, 347, 317, 443, 373, 467, 389, 499, 397, 523]