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.

A285300 Numbers k such that 3^(k-1) == 2^(k-1) !== 1 (mod k).

Table of values

n a(n)
1 65
2 133
3 529
4 793
5 1649
6 2059
7 2321
8 4187
9 5185
10 6305
11 6541
12 6697
13 6817
14 7471
15 7613
16 8113
17 10963
18 11521
19 13213
20 13333
21 13427
22 14701
23 14981
24 19171
25 19201
26 19909
27 21349
28 21667
29 22177
30 26065
31 26467
32 32873
33 35443
34 36569
35 37333
36 38897
37 42121
38 42127
39 44023
40 47081

List of values

[65, 133, 529, 793, 1649, 2059, 2321, 4187, 5185, 6305, 6541, 6697, 6817, 7471, 7613, 8113, 10963, 11521, 13213, 13333, 13427, 14701, 14981, 19171, 19201, 19909, 21349, 21667, 22177, 26065, 26467, 32873, 35443, 36569, 37333, 38897, 42121, 42127, 44023, 47081]