|
|
A108787
|
|
Binary numbers such that the first differences give the same sequence written as a string of individual digits.
|
|
4
|
|
|
1, 10, 11, 11, 100, 101, 110, 111, 1000, 1000, 1000, 1001, 1001, 1010, 1011, 1100, 1100, 1101, 1110, 1111, 10000, 10000, 10000, 10000, 10001, 10001, 10001, 10001, 10010, 10010, 10010, 10010, 10011, 10011, 10011, 10100, 10101, 10101
(list;
graph;
refs;
listen;
history;
text;
internal format)
|
|
|
OFFSET
|
1,2
|
|
LINKS
|
|
|
EXAMPLE
|
1, 10, 11, 11, 100, 101, 110, 111, 1000, 1000, 1001, 1001, ... <- sequence (base 2)
..1..1..0..1..1..1..1..1..0..0..1..0... <- first difference are the sequence's digits.
|
|
MAPLE
|
A[1]:= 1: B:= 1: S:= "1":
for n from 2 to 100 do
B:= B + parse(S[n-1]);
A[n]:= convert(B, binary);
S:= cat(S, A[n]);
od:
|
|
CROSSREFS
|
Cf. A100787 for a similar sequence in decimal.
|
|
KEYWORD
|
base,easy,nonn
|
|
AUTHOR
|
|
|
STATUS
|
approved
|
|
|
|