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.

A307244 a(0) = 1; a(n) is the smallest integer k > a(n-1) such that 3^(k-1) == 1 (mod a(n-1)*k).

Table of values

n a(n)
0 1
1 2
2 5
3 13
4 19
5 37
6 73
7 97
8 193
9 241
10 601
11 751
12 2251
13 3001
14 4001
15 16001
16 96001
17 160001
18 1120001
19 4480001
20 13440001
21 20160001
22 23385601
23 29232001
24 36540001
25 38628001
26 115884001
27 231768001
28 579420001
29 1448550001
30 1931400001
31 2172825001
32 6518475001
33 22814662501
34 53234212501
35 425873700001
36 1703494800001

List of values

[1, 2, 5, 13, 19, 37, 73, 97, 193, 241, 601, 751, 2251, 3001, 4001, 16001, 96001, 160001, 1120001, 4480001, 13440001, 20160001, 23385601, 29232001, 36540001, 38628001, 115884001, 231768001, 579420001, 1448550001, 1931400001, 2172825001, 6518475001, 22814662501, 53234212501, 425873700001, 1703494800001]

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

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