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.

A353624 a(0) = 0, and for n > 0, a(n) is the least multiple of n that can be added to n without carries in balanced ternary.

Table of values

n a(n)
0 0
1 2
2 6
3 6
4 8
5 30
6 18
7 21
8 16
9 18
10 20
11 55
12 24
13 26
14 84
15 90
16 80
17 51
18 54
19 57
20 60
21 63
22 132
23 46
24 48
25 75
26 52
27 54
28 56
29 87
30 60
31 62
32 288
33 165
34 408
35 70
36 72
37 74
38 456
39 78
40 80
41 246
42 252
43 516
44 484
45 270
46 276
47 658
48 240
49 441
50 400
51 153
52 156
53 159
54 162
55 165
56 168
57 171
58 522
59 649

List of values

[0, 2, 6, 6, 8, 30, 18, 21, 16, 18, 20, 55, 24, 26, 84, 90, 80, 51, 54, 57, 60, 63, 132, 46, 48, 75, 52, 54, 56, 87, 60, 62, 288, 165, 408, 70, 72, 74, 456, 78, 80, 246, 252, 516, 484, 270, 276, 658, 240, 441, 400, 153, 156, 159, 162, 165, 168, 171, 522, 649]