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.

A054390 Number of ways of writing n as a sum of powers of 3, each power being used at most three times.

Table of values

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

List of values

[1, 1, 1, 2, 1, 1, 2, 1, 1, 3, 2, 2, 3, 1, 1, 2, 1, 1, 3, 2, 2, 3, 1, 1, 2, 1, 1, 4, 3, 3, 5, 2, 2, 4, 2, 2, 5, 3, 3, 4, 1, 1, 2, 1, 1, 3, 2, 2, 3, 1, 1, 2, 1, 1, 4, 3, 3, 5, 2, 2, 4, 2, 2, 5, 3, 3, 4, 1, 1, 2, 1, 1, 3, 2, 2, 3, 1, 1, 2, 1, 1, 5, 4, 4, 7, 3, 3, 6, 3, 3, 8, 5, 5, 7, 2, 2, 4, 2, 2, 6, 4, 4, 6, 2, 2]