|
|
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.
|
|
2
|
|
|
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
(list;
graph;
refs;
listen;
history;
text;
internal format)
|
|
|
OFFSET
|
0,3
|
|
COMMENTS
|
Leading zeros may appear in binary words w_2, ..., w_{k-1}.
a(n) gives the number of ways to erase the binary expansion of n bit by bit.
|
|
LINKS
|
|
|
FORMULA
|
a(2^k) = k + 1 for any k >= 0.
|
|
EXAMPLE
|
For n = 5:
- the binary expansion of 5 is "101",
- we have the following appropriate sequences of binary words:
("101", "11", "1", "")
("101", "10", "1", "")
("101", "10", "0", "")
("101", "01", "1", "")
("101", "01", "0", "")
- hence a(5) = 5.
|
|
PROG
|
(PARI) See Links section.
|
|
CROSSREFS
|
|
|
KEYWORD
|
nonn,base
|
|
AUTHOR
|
|
|
STATUS
|
approved
|
|
|
|