login
This site is supported by donations to The OEIS Foundation.
Logo

Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A062128 In base 2: start with n; if palindrome, stop; otherwise add to itself with digits reversed; a(n) gives palindrome at which it stops, or -1 if no palindrome is ever reached. 5
0, 1, 11, 11, 101, 101, 1001, 111, 1001, 1001, 1111, 11011, 1111, 11011, 10101, 1111, 10001, 10001, 11011, 1100011, 1100011, 10101, -1, 111111, 11011, 1100011, -1, 11011, -1, 111111, 101101, 11111, 100001, 100001, 110011, -1, 101101, -1, 111111, 1100011, 101101, -1, 111111, 1100011, 1100011 (list; graph; refs; listen; history; internal format)
OFFSET

0,3

COMMENTS

The analogue of A033865 in base 2.

LINKS

Index entries for sequences related to Reverse and Add!

Klaus Brockhaus, On the'Reverse and Add!' algorithm in base 2

EXAMPLE

23: 10111 -> 10111 + 11101 = 110100 -> 110100 + 1011 = 111111, so a(23) = 111111.

PROG

(ARIBAS): stop := 500; for k := 0 to 60 do c := 0; m := k; rev := bit_reverse(m); while m <> rev and c < stop do inc(c); m := m + rev; rev := bit_reverse(m); end; if c < stop then bit_write(m); else write(-1); end; write(" "); end; .

CROSSREFS

A033865, A062129, A062130, A058042.

Sequence in context: A014461 A111221 A088761 * A099630 A088772 A088771

Adjacent sequences:  A062125 A062126 A062127 * A062129 A062130 A062131

KEYWORD

base,easy,sign

AUTHOR

Klaus Brockhaus (klaus-brockhaus(AT)t-online.de), Jun 06 2001

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Transforms | Puzzles | Hot | Classics
Recent Additions | More pages | Superseeker | Maintained by The OEIS Foundation Inc.

Content is available under The OEIS End-User License Agreement .

Last modified February 15 09:47 EST 2012. Contains 205762 sequences.