|
Search: id:A058042
|
|
|
| A058042 |
|
Trajectory of binary number 10110 under the operation 'Reverse and Add!' carried out in base 2. |
|
+0
20
|
|
| 10110, 100011, 1010100, 1101001, 10110100, 11100001, 101101000, 110010101, 1011101000, 1101000101, 10111010000, 11000101101, 101111010000, 110010001101, 1011110100000, 1100001011101, 10111110100000
(list; graph; listen)
|
|
|
OFFSET
|
0,1
|
|
|
COMMENT
|
According to J. Walker, Ronald Sprague has proved that this trajectory does not contain a palindrome. [I would like a reference for this.] Another proof has been given by Klaus Brockhaus.
10110 is the smallest number with this property in base 2. The analogous number in base 10 is believed to be 196, but its trajectory (see A006960) has never been proved not to contain a palindrome.
|
|
REFERENCES
|
T. Irvin, About Two Months of Computing, or An Addendum to Mr. Walker's Three Years of Computing.
|
|
LINKS
|
T. D. Noe, Table of n, a(n) for n=0..500
Klaus Brockhaus, On the 'Reverse and Add!' algorithm in base 2
J. Walker, Three Years Of Computing: Final Report On The Palindrome Quest
Index entries for sequences related to Reverse and Add!
|
|
PROGRAM
|
(ARIBAS) var m, c, rev: integer; end; m := 22; c := 1; bit_write(m); write(" "); rev := bit_reverse(m); while m <> rev and c < 25 do inc(c); m := m + rev; bit_write(m); write(" "); rev := bit_reverse(m); end;
|
|
CROSSREFS
|
See A061561 for the terms of A058042 written in base 10. Cf. A016016, A006960, A023108.
Sequence in context: A043641 A114385 A144863 this_sequence A161786 A157711 A159863
Adjacent sequences: A058039 A058040 A058041 this_sequence A058043 A058044 A058045
|
|
KEYWORD
|
nonn,nice,base
|
|
AUTHOR
|
N. J. A. Sloane (njas(AT)research.att.com), May 18 2001
|
|
EXTENSIONS
|
More terms from Klaus Brockhaus (klaus-brockhaus(AT)t-online.de), May 27 2001
|
|
|
Search completed in 0.002 seconds
|
