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.

A306144 Numbers k > 2 such that 3^(k-1) == 1 (mod k) and gcd(k, 2^(k-1)-1) = 1.

Table of values

n a(n)
1 286
2 16531
3 24046
4 49051
5 72041
6 182527
7 192713
8 232726
9 258017
10 327781
11 442471
12 443713
13 453259
14 574397
15 625873
16 652879
17 655051
18 668431
19 705091
20 903631
21 1236031
22 1241143
23 1250833
24 1287091
25 1304446
26 1309111
27 1351601
28 1414639
29 1563151
30 1817743
31 1899451
32 1908397

List of values

[286, 16531, 24046, 49051, 72041, 182527, 192713, 232726, 258017, 327781, 442471, 443713, 453259, 574397, 625873, 652879, 655051, 668431, 705091, 903631, 1236031, 1241143, 1250833, 1287091, 1304446, 1309111, 1351601, 1414639, 1563151, 1817743, 1899451, 1908397]

Started in 1964 by Neil J. A. Sloane | Maintained by The OEIS Foundation Inc.

Content is available under The OEIS End-User License Agreement.