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.

A321882 a(n) is the least base b > 1 such that the sum n + n can be computed without carry.

Table of values

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

List of values

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