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.

A358095 a(n) is the number of ways n can be reached in the algorithm explained in A358094 if the last operation is summation.

Table of values

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

List of values

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