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.

A131741 a(n) is least prime (not already in list) such that no 3-term subset forms an arithmetic progression.

Table of values

n a(n)
1 2
2 3
3 5
4 11
5 13
6 29
7 31
8 37
9 41
10 67
11 73
12 83
13 89
14 101
15 107
16 127
17 139
18 157
19 179
20 193
21 227
22 233
23 263
24 271
25 281
26 307
27 331
28 337
29 379
30 389
31 397
32 401
33 409
34 431
35 433
36 467
37 491
38 499
39 509
40 563
41 571
42 613
43 641
44 647
45 743
46 769
47 809
48 823
49 883
50 887
51 907
52 937
53 983
54 1009
55 1021

List of values

[2, 3, 5, 11, 13, 29, 31, 37, 41, 67, 73, 83, 89, 101, 107, 127, 139, 157, 179, 193, 227, 233, 263, 271, 281, 307, 331, 337, 379, 389, 397, 401, 409, 431, 433, 467, 491, 499, 509, 563, 571, 613, 641, 647, 743, 769, 809, 823, 883, 887, 907, 937, 983, 1009, 1021]