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.

A352501 a(n) is the distance from n to the nearest integer that can be added to n without carries in balanced ternary.

Table of values

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

List of values

[0, 1, 1, 2, 1, 1, 2, 4, 4, 5, 4, 4, 2, 1, 1, 2, 4, 4, 5, 7, 10, 11, 13, 10, 11, 13, 13, 14, 13, 13, 11, 10, 13, 11, 10, 7, 5, 4, 4, 2, 1, 1, 2, 4, 4, 5, 7, 10, 11, 13, 10, 11, 13, 13, 14, 16, 19, 20, 22, 28, 29, 31, 31, 32, 34, 37, 38, 40, 28, 29, 31, 31, 32]

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

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