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.

A353623 a(n) is the least k > 0 such that n and k*n can be added without carries in balanced ternary.

Table of values

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

List of values

[1, 2, 3, 2, 2, 6, 3, 3, 2, 2, 2, 5, 2, 2, 6, 6, 5, 3, 3, 3, 3, 3, 6, 2, 2, 3, 2, 2, 2, 3, 2, 2, 9, 5, 12, 2, 2, 2, 12, 2, 2, 6, 6, 12, 11, 6, 6, 14, 5, 9, 8, 3, 3, 3, 3, 3, 3, 3, 9, 11, 3, 3, 3, 3, 3, 14, 6, 6, 2, 2, 9, 2, 2, 2, 3, 3, 6, 2, 2, 3, 2, 2, 2, 3, 2]

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

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