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.

A355915 Number of ways to write n as a sum of numbers of the form 2^r * 3^s, where r and s are >= 0, and no summand divides another.

Table of values

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

List of values

[1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 2, 1, 1, 1, 1, 1, 1, 1, 2, 1, 1, 2, 1, 1, 1, 1, 1, 1, 2, 1, 2, 1, 2, 1, 2, 1, 2, 2, 1, 1, 2, 1, 1, 2, 1, 1, 2, 1, 3, 1, 1, 1, 2, 1, 1, 1, 2, 2, 1, 1, 1, 2, 1, 1, 3, 2, 2, 1, 1, 2, 2, 1, 2, 2, 1, 2, 1, 1, 2, 1, 1, 2, 2, 1, 3, 1, 2, 2, 3, 1, 2, 1, 2, 2, 2, 1, 3, 3, 2, 1]