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.

A075341 a(1) = 1, a(2n) is the smallest composite number == 1 mod (a(2n-1)) and a(2n+1) is the smallest prime == 1 (mod a(2n)).

Table of values

n a(n)
1 1
2 4
3 5
4 6
5 7
6 8
7 17
8 18
9 19
10 20
11 41
12 42
13 43
14 44
15 89
16 90
17 181
18 182
19 547
20 548
21 1097
22 1098
23 7687
24 7688
25 15377
26 15378
27 30757
28 30758
29 276823
30 276824
31 553649
32 553650
33 2768251
34 2768252
35 8304757
36 8304758
37 99657097
38 99657098
39 199314197
40 199314198

List of values

[1, 4, 5, 6, 7, 8, 17, 18, 19, 20, 41, 42, 43, 44, 89, 90, 181, 182, 547, 548, 1097, 1098, 7687, 7688, 15377, 15378, 30757, 30758, 276823, 276824, 553649, 553650, 2768251, 2768252, 8304757, 8304758, 99657097, 99657098, 199314197, 199314198]