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.

A368070 a(n) is the number of sequences of binary words (w_1, ..., w_k) such that w_1 corresponds to the binary expansion of n (without leading zeros), for m = 1..k-1, w_{m+1} is obtained by removing one bit from w_m, and w_k is the empty word.

Table of values

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

List of values

[1, 1, 2, 1, 3, 5, 3, 1, 4, 11, 16, 9, 6, 9, 4, 1, 5, 19, 40, 26, 35, 61, 40, 14, 10, 26, 35, 19, 10, 14, 5, 1, 6, 29, 78, 55, 99, 181, 132, 50, 64, 181, 272, 155, 111, 169, 78, 20, 15, 55, 111, 71, 90, 155, 99, 34, 20, 50, 64, 34, 15, 20, 6, 1, 7, 41, 133, 99]