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.

A205565 Number of ways of writing n = u + v with u <= v, and u,v having in ternary representation no 3.

Table of values

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

List of values

[1, 1, 1, 1, 2, 1, 1, 1, 1, 1, 2, 1, 2, 4, 2, 1, 2, 1, 1, 1, 1, 1, 2, 1, 1, 1, 1, 1, 2, 1, 2, 4, 2, 1, 2, 1, 2, 4, 2, 4, 8, 4, 2, 4, 2, 1, 2, 1, 2, 4, 2, 1, 2, 1, 1, 1, 1, 1, 2, 1, 1, 1, 1, 1, 2, 1, 2, 4, 2, 1, 2, 1, 1, 1, 1, 1, 2, 1, 1, 1, 1, 1, 2, 1, 2, 4]