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.

A354578 Number of ways to choose a divisor of each part of the n-th composition in standard order such that no adjacent divisors are equal.

Table of values

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

List of values

[1, 1, 2, 0, 2, 1, 1, 0, 3, 1, 2, 0, 1, 1, 0, 0, 2, 2, 3, 0, 3, 1, 1, 0, 2, 1, 1, 0, 0, 0, 0, 0, 4, 1, 4, 0, 2, 2, 1, 0, 4, 2, 2, 0, 1, 1, 0, 0, 1, 2, 2, 0, 2, 0, 1, 0, 0, 0, 0, 0, 0, 0, 0, 0, 2, 3, 3, 0, 5, 2, 2, 0, 5, 1, 3, 0, 1, 1, 0, 0, 3, 3, 5, 0, 3, 1, 1]