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.

A343541 For n > 1, a(n) is the largest base b <= prime(n)-1 such that the digits of prime(n)-1 in base b contain the digit b-1.

Table of values

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

List of values

[2, 2, 3, 2, 4, 3, 3, 5, 4, 6, 2, 2, 7, 7, 4, 8, 8, 6, 6, 9, 9, 2, 3, 10, 5, 6, 6, 5, 11, 8, 3, 12, 12, 5, 3, 13, 13, 13, 5, 6, 6, 14, 14, 10, 10, 15, 15, 5, 5, 11, 11, 16, 16, 2, 3, 4, 5, 17, 17, 17, 10, 18, 18, 18, 18, 13, 13, 19, 19, 19]

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

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