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.

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

Table of values

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

List of values

[1, 0, 1, 2, 2, 2, 2, 3, 2, 1, 0, 1, 0, 0, 2, 2, 1, 3, 2, 4, 5, 2, 4, 9, 5, 2, 7, 8, 6, 6, 4, 7, 5, 3, 8, 5, 3, 2, 4, 8, 2, 0, 4, 4, 7, 0, 0, 4, 3, 4, 2, 1, 2, 3, 2, 1, 3, 1, 1, 5, 2, 2, 6, 4, 3, 5, 4, 5, 7, 2, 3, 10, 5, 4, 10, 7, 5, 7, 7, 10, 9, 2, 5, 17, 9, 5]