|
Search: id:A037834
|
|
|
| A037834 |
|
Sum{|d(i)-d(i-1)|: i=1,...,m}, where Sum{d(i)^2^i: i=0,1,...,m} is base 2 representation of n. |
|
+0
3
|
|
| 0, 1, 0, 1, 2, 1, 0, 1, 2, 3, 2, 1, 2, 1, 0, 1, 2, 3, 2, 3, 4, 3, 2, 1, 2, 3, 2, 1, 2, 1, 0, 1, 2, 3, 2, 3, 4, 3, 2, 3, 4, 5, 4, 3, 4, 3, 2, 1, 2, 3, 2, 3, 4, 3, 2, 1, 2, 3, 2, 1, 2, 1, 0, 1, 2, 3, 2, 3, 4, 3, 2, 3, 4, 5, 4, 3, 4, 3, 2, 3, 4, 5, 4, 5, 6, 5, 4, 3, 4, 5
(list; graph; listen)
|
|
|
OFFSET
|
1,5
|
|
|
COMMENT
|
Number of i such that |d(i)-d(i-1)|=1, where Sum{d(i)*2^i: i=0,1,...,m} is base 2 representation of n.
|
|
MAPLE
|
P:=proc(i) local a, b, c, d, n; print(0); for n from 2 by 1 to i do a:=convert(convert(n, binary), string); b:=length(a); c:=2; d:=0; while c<=b do if substring(a, c-1)<>substring(a, c) then d:=d+1; fi; c:=c+1; od; print(d); od; end: P(200); [From Paolo P. Lava (ppl(AT)spl.at), Sep 02 2009]
|
|
CROSSREFS
|
A005811(n)-1.
Sequence in context: A106509 A053615 A002819 this_sequence A004074 A053646 A080776
Adjacent sequences: A037831 A037832 A037833 this_sequence A037835 A037836 A037837
|
|
KEYWORD
|
nonn,base
|
|
AUTHOR
|
Clark Kimberling (ck6(AT)evansville.edu)
|
|
|
Search completed in 0.008 seconds
|
