OFFSET
1,5
COMMENTS
LINKS
Antti Karttunen, Table of n, a(n) for n = 1..11265
FORMULA
EXAMPLE
Table begins as:
Row n in Terms on
n binary that row
1 1 0; (the distance of 1-bit from the right edge is zero)
2 10 1; (the distance of 1-bit from the right edge is one)
3 11 0,0;
4 100 2;
5 101 0,1; (the least significant 1-bit is zero steps away from the right edge, and there is one zero between those two 1-bits)
6 110 1,0;
7 111 0,0,0;
8 1000 3;
9 1001 0,2;
10 1010 1,1;
11 1011 0,0,1;
12 1100 2,0;
13 1101 0,1,0;
14 1110 1,0,0;
15 1111 0,0,0,0;
16 10000 4;
MATHEMATICA
Table[Reverse@ Map[Ceiling[(Length@ # - 1)/2] &, DeleteCases[Split@ Join[Riffle[IntegerDigits[n, 2], 0], {0}], {k__} /; k == 1]], {n, 46}] // Flatten (* Michael De Vlieger, Jul 25 2016 *)
PROG
;; See A227186 for A227186bi. - Antti Karttunen, Jun 19 2014
(Python)
from itertools import count, islice
def A163510_gen(): # generator of terms
for n in count(1):
k = n
while k:
yield (s:=(~k&k-1).bit_length())
k >>= s+1
CROSSREFS
KEYWORD
base,nonn,tabf
AUTHOR
Leroy Quet, Jul 29 2009
EXTENSIONS
Additional terms computed and Example section added by Antti Karttunen, Jun 19 2014
STATUS
approved