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.

A352502 a(n) is the number of integers k in the interval 0..n such that k and n-k can be added without carries in balanced ternary.

Table of values

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

List of values

[1, 2, 2, 4, 4, 2, 4, 4, 6, 10, 8, 6, 10, 8, 2, 4, 4, 6, 10, 8, 6, 10, 8, 10, 16, 12, 18, 28, 20, 14, 22, 16, 10, 16, 12, 18, 28, 20, 14, 22, 16, 2, 4, 4, 6, 10, 8, 6, 10, 8, 10, 16, 12, 18, 28, 20, 14, 22, 16, 10, 16, 12, 18, 28, 20, 14, 22, 16, 18, 28, 20, 30]

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

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