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.

A362840 a(n) is the smallest number x between 1 and n-1 for which the number 1/x achieves the longest cycle of repeating digits in its expansion in base n.

Table of values

n a(n)
3 2
4 3
5 3
6 5
7 5
8 5
9 7
10 7
11 9
12 7
13 11
14 9
15 13
16 11
17 11
18 11
19 13
20 17
21 19
22 19
23 17
24 17
25 23
26 23
27 25
28 23
29 19
30 23
31 29
32 29
33 23
34 31
35 29
36 23
37 29
38 23
39 37
40 29
41 19
42 37
43 31
44 31
45 17
46 43
47 41
48 43
49 47
50 37
51 47
52 47
53 41
54 49
55 53
56 53
57 47
58 53
59 49
60 47
61 59
62 47
63 61
64 59
65 59
66 47
67 61
68 61
69 67
70 59
71 61
72 59

List of values

[2, 3, 3, 5, 5, 5, 7, 7, 9, 7, 11, 9, 13, 11, 11, 11, 13, 17, 19, 19, 17, 17, 23, 23, 25, 23, 19, 23, 29, 29, 23, 31, 29, 23, 29, 23, 37, 29, 19, 37, 31, 31, 17, 43, 41, 43, 47, 37, 47, 47, 41, 49, 53, 53, 47, 53, 49, 47, 59, 47, 61, 59, 59, 47, 61, 61, 67, 59, 61, 59]

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

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