|
Search: id:A036213
|
|
|
| A036213 |
|
Duplicating binary multipliers, i.e. n+1 1-bits placed 2n bits from each other. |
|
+0
3
|
|
| 1, 5, 273, 266305, 4311810305, 1127000493261825, 4723519685917965029377, 316931994050834867150735294465, 340287559297026369749534115703797383169
(list; graph; listen)
|
|
|
OFFSET
|
0,2
|
|
|
COMMENT
|
A 2n-bit binary number can be reversed by multiplying it first by 2 and the
n-th element of this sequence, masking it (bit and) with n-th element of A036214
and taking remainder of the division by ((2^((2*n)+2)) -1).
|
|
REFERENCES
|
R. Schroeppel: DECsystem-10/20 Processor Reference Manual AA-H391A-TK, Chapter 2, User Operations, section 2.15: Programming Examples: Reversing Order of Digits.
|
|
LINKS
|
Beeler, M., Gosper, R. W. and Schroeppel, R., A Bit-Reversing Example in HAKMEM (Item 167)
A. Karttunen, A Simple C-program Demonstrating Bit-Reversals
|
|
FORMULA
|
a(0) = 1, a(n) = ((2^((2*(n^2))+2*(n)))-1)/((2^(2*n))-1).
|
|
CROSSREFS
|
Sequence in context: A140001 A153322 A066210 this_sequence A112901 A158115 A057209
Adjacent sequences: A036210 A036211 A036212 this_sequence A036214 A036215 A036216
|
|
KEYWORD
|
nonn
|
|
AUTHOR
|
Antti Karttunen
|
|
|
Search completed in 0.002 seconds
|
