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.

A330827 a(n) is the numbers of ways to write 2*n = u + v where the ternary representations of u and of v have the same number of digits d for d = 0..2.

Table of values

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

List of values

[1, 1, 1, 1, 1, 1, 3, 1, 1, 1, 1, 3, 1, 3, 1, 5, 3, 3, 5, 3, 5, 3, 3, 1, 3, 1, 1, 1, 1, 3, 1, 3, 3, 5, 3, 5, 3, 5, 5, 5, 7, 5, 7, 7, 5, 9, 7, 7, 11, 7, 9, 7, 7, 7, 11, 9, 13, 5, 9, 5, 15, 7, 9, 7, 7, 7, 7, 7, 5, 5, 5, 3, 5, 3, 5, 3, 3, 1, 3, 1, 1, 1, 1, 3, 1, 3]