|
Search: id:A045998
|
|
|
| A045998 |
|
Binary Gleichniszahlen-Reihe (BGR) sequence: describe previous term (cf. A005150), reduce number of digits seen mod 2 (then for the purposes of this data-base, discard leading zeros). |
|
+0
3
|
|
| 1, 11, 1, 1011, 111001, 110011, 10001, 10111011, 1110111001, 1110110011, 1110010001, 1100111011, 100111001, 101100110011, 11100100010001, 11001110111011, 1001110111001, 1011001110110011, 111001001110010001
(list; graph; listen)
|
|
|
OFFSET
|
0,2
|
|
|
COMMENT
|
Terms with a leading zero: a(2),a(6),a(12),a(16),a(20),a(28),a(32),a(36),a(40),a(44),a(48),a(60),...
|
|
REFERENCES
|
N. Worrick, S. Lewis and B. Shrader, A possible formula for the length of BGR sequences, Graph Theory Notes of New York, XXXVI (1999), p. 25.
|
|
EXAMPLE
|
1,11,01,1011,111001,110011,010001,... (after 110011, next term is 212021 -> 010001 -> 10001).
|
|
CROSSREFS
|
Cf. A005150, A045999, A048522.
Sequence in context: A093158 A132098 A160480 this_sequence A027645 A010190 A087774
Adjacent sequences: A045995 A045996 A045997 this_sequence A045999 A046000 A046001
|
|
KEYWORD
|
nonn,base,easy
|
|
AUTHOR
|
N. J. A. Sloane (njas(AT)research.att.com).
|
|
EXTENSIONS
|
More terms from Patrick De Geest (pdg(AT)worldofnumbers.com), Jun 15 1999.
|
|
|
Search completed in 0.002 seconds
|
