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.

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

Table of values

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

List of values

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

Started in 1964 by Neil J. A. Sloane | Maintained by The OEIS Foundation Inc.

Content is available under The OEIS End-User License Agreement.