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.

A301453 a(n) is the number of ways of writing the binary expansion of n as a concatenation of nonempty substrings with no two consecutive equal substrings.

Table of values

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

List of values

[1, 1, 2, 1, 3, 4, 3, 3, 6, 7, 7, 6, 5, 6, 6, 4, 10, 13, 14, 11, 11, 14, 14, 12, 9, 11, 11, 9, 9, 12, 10, 7, 17, 23, 26, 20, 20, 26, 25, 21, 23, 26, 28, 22, 22, 27, 26, 20, 16, 20, 22, 17, 17, 22, 20, 18, 18, 21, 23, 18, 16, 20, 17, 14, 31, 40, 46, 36, 39, 49]