|
Search: id:A066122
|
|
|
| A066122 |
|
In base 2, one 'Reverse and Add' step is needed to reach a palindrome. |
|
+0
12
|
|
| 2, 4, 6, 8, 10, 12, 14, 16, 18, 24, 30, 32, 34, 36, 38, 40, 42, 48, 52, 56, 62, 64, 66, 68, 70, 80, 82, 96, 100, 102, 112, 114, 126, 128, 130, 132, 134, 136, 138, 140, 142, 144, 146, 148, 150, 160, 162, 168, 170, 176, 178, 192, 196, 198, 200, 204, 208, 212, 224
(list; graph; listen)
|
|
|
OFFSET
|
0,1
|
|
|
COMMENT
|
The analogue of A065206 in base 2. The number of steps starts at 0, so palindromes (cf. A006995) are excluded.
|
|
LINKS
|
Index entries for sequences related to Reverse and Add!
|
|
PROGRAM
|
(ARIBAS): function b2revadd_steps(k, stop: integer); var c, n, m, steps, rev: integer; begin n := 0; c := 0; while c < stop do m := n; rev := b2reverse(m); steps := 0; while steps < k and m <> rev do m := m + rev; rev := b2reverse(m); inc(steps); end; if steps = k and m = rev then write(n, " "); inc(c); end; inc(n); end; end; b2revadd_steps(1, 66).
|
|
CROSSREFS
|
A006995, A065206.
Adjacent sequences: A066119 A066120 A066121 this_sequence A066123 A066124 A066125
Sequence in context: A134930 A084562 A118070 this_sequence A119766 A030143 A110725
|
|
KEYWORD
|
base,nonn
|
|
AUTHOR
|
Klaus Brockhaus (klaus-brockhaus(AT)t-online.de), Dec 08 2001
|
|
|
Search completed in 0.002 seconds
|
