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.

A358094 a(n) is the number of ways n can be reached in the following method: we start with 1, then add or multiply alternately, and each operand must be 2 or 3.

Table of values

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

List of values

[1, 1, 2, 2, 2, 2, 0, 3, 2, 4, 3, 6, 2, 3, 5, 1, 2, 5, 1, 4, 2, 5, 2, 7, 3, 6, 5, 5, 3, 9, 3, 5, 8, 2, 3, 11, 2, 7, 8, 3, 3, 9, 2, 7, 8, 4, 5, 8, 2, 6, 5, 7, 5, 13, 4, 9, 8, 5, 3, 10, 3, 9, 8, 8, 5, 14, 5, 7, 9, 3, 2, 13, 3, 10, 11, 8, 5, 19, 6, 11]