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.

A090938 Least multiple of n == 1 (mod prime(n)).

Table of values

n a(n)
1 1
2 4
3 6
4 8
5 45
6 66
7 35
8 96
9 162
10 30
11 187
12 408
13 247
14 560
15 330
16 160
17 119
18 306
19 1140
20 640
21 147
22 396
23 1495
24 624
25 1650
26 910
27 1134
28 1820
29 2726
30 1470
31 1271
32 2752
33 1782
34 1530
35 4620
36 756
37 629
38 5054
39 1170
40 520
41 5371
42 5250
43 1720
44 5984
45 7290
46 598
47 423
48 3792
49 6811
50 7100

List of values

[1, 4, 6, 8, 45, 66, 35, 96, 162, 30, 187, 408, 247, 560, 330, 160, 119, 306, 1140, 640, 147, 396, 1495, 624, 1650, 910, 1134, 1820, 2726, 1470, 1271, 2752, 1782, 1530, 4620, 756, 629, 5054, 1170, 520, 5371, 5250, 1720, 5984, 7290, 598, 423, 3792, 6811, 7100]

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

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