|
Search: id:A062129
|
|
|
| A062129 |
|
In base 2: start with n; add to itself with digits reversed; if palindrome, stop; otherwise repeat; a(n) gives palindrome at which it stops, or -1 if no palindrome is ever reached. |
|
+0
3
|
|
| 0, 11, 11, 1001, 101, 1111, 1001, 10101, 1001, 11011, 1111, 11011, 1111, 11011, 10101, 101101, 10001, 110011, 11011, 1100011, 1100011, 111111, -1, 111111, 11011, 1100011, -1, 11111111, -1, 111111, 101101, 1011101, 100001, 1100011, 110011, -1, 101101, -1, 111111, 1100011, 101101, -1, 111111
(list; graph; listen)
|
|
|
OFFSET
|
0,2
|
|
|
COMMENT
|
The analogue of A061563 in base 2. Differs from A062128 only for those n, which are palindromes in base 2.
|
|
EXAMPLE
|
23: 10111 -> 10111 + 11101 = 110100 -> 110100 + 1011 = 111111, so a(23) = 111111.
|
|
PROGRAM
|
(ARIBAS): stop := 500; for k := 0 to 60 do c := 0; m := k; test := true; while test and c < stop do inc(c); m := m + bit_reverse(m); test := m <> bit_reverse(m); end; if c < stop then bit_write(m); else write(-1); end; write(" "); end; .
|
|
CROSSREFS
|
A061563, A062128, A062131, A058042.
Sequence in context: A131664 A110381 A038325 this_sequence A092805 A004285 A140105
Adjacent sequences: A062126 A062127 A062128 this_sequence A062130 A062131 A062132
|
|
KEYWORD
|
base,easy,sign
|
|
AUTHOR
|
Klaus Brockhaus (klaus-brockhaus(AT)t-online.de), Jun 06 2001
|
|
|
Search completed in 0.002 seconds
|
