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.

A287076 a(n) = least k > n with the same sum of digits as n in some base b > 1.

Table of values

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

List of values

[2, 4, 5, 6, 6, 9, 10, 12, 10, 12, 13, 16, 14, 16, 19, 20, 18, 20, 21, 22, 22, 24, 25, 30, 26, 28, 29, 30, 30, 36, 33, 34, 34, 36, 37, 40, 38, 40, 42, 42, 42, 44, 45, 48, 46, 48, 49, 56, 50, 52, 53, 56, 54, 57, 57, 58, 58, 60, 61, 64, 62, 66, 67, 66, 66, 68, 69]