|
Search: id:A066058
|
|
|
| A066058 |
|
In base 2: smallest integer which requires n 'Reverse and Add' steps to reach a palindrome. |
|
+0
6
|
|
| 0, 2, 11, 44, 19, 20, 275, 326, 259, 202, 103, 74, 1027, 1070, 1049, 1072, 1547, 1310, 1117, 794, 569, 398, 3083, 2154, 1177, 1064, 4697, 4264, 4443, 2678, 2169, 1422, 779, 3226, 1551, 1114, 1815, 1062, 4197, 3106, 8697, 7238, 16633, 12302, 6683
(list; graph; listen)
|
|
|
OFFSET
|
0,2
|
|
|
COMMENT
|
The analogue of A023109 in base 2. Program: (ARIBAS): For function b2reverse see A066057; function a066058(mx: integer); var k,m,n,rev,steps: integer; begin for k := 0 to mx do n := 0; steps := 0; m := n; rev := b2reverse(m); while not(steps = k and m = rev) do inc(n); m := n; rev := b2reverse(m); steps := 0; while steps < k and m <> rev do m := m + rev; rev := b2reverse(m); inc(steps); end; end; write(n,","); end; end; a066058(45).
|
|
LINKS
|
Index entries for sequences related to Reverse and Add!
|
|
EXAMPLE
|
11 is the smallest integer which requires two steps to reach a base 2 palindrome (cf. A066057), so a(2) = 11; written in base 10: 11 -> 11 + 13 = 24 -> 24 + 3 = 27; written in base 2: 1011 -> 1011 + 1101 = 11000 -> 11000 + 11 = 11011.
|
|
CROSSREFS
|
Cf. A066057, A023109, A062128, A062130, A033865, A006995, A057148.
Sequence in context: A048500 A050620 A027253 this_sequence A153440 A037744 A037625
Adjacent sequences: A066055 A066056 A066057 this_sequence A066059 A066060 A066061
|
|
KEYWORD
|
base,nonn
|
|
AUTHOR
|
Klaus Brockhaus (klaus-brockhaus(AT)t-online.de), Dec 04 2001
|
|
|
Search completed in 0.002 seconds
|
