|
Search: id:A053642
|
|
|
| A053642 |
|
Rotate one binary digit to the left, calculate, then rotate one binary digit to the right. |
|
+0
1
|
|
| 1, 1, 3, 1, 3, 6, 7, 1, 3, 6, 7, 12, 13, 14, 15, 1, 3, 6, 7, 12, 13, 14, 15, 24, 25, 26, 27, 28, 29, 30, 31, 1, 3, 6, 7, 12, 13, 14, 15, 24, 25, 26, 27, 28, 29, 30, 31, 48, 49, 50, 51, 52, 53, 54, 55, 56, 57, 58, 59, 60, 61, 62, 63, 1
(list; graph; listen)
|
|
|
OFFSET
|
1,3
|
|
|
COMMENT
|
Sequence contains ever longer copies of A004760. - Ralf Stephan (ralf(AT)ark.in-berlin.de), Sep 16 2003
|
|
FORMULA
|
a(n) = A038572(A006257(n)), =n if 3*2^(k-1)<=n<2^(k+1), =a(n-2^(k-1)) if 2^k<=n<3*2^(k-1)
a(2n) = 2a(n) - [a(n)==1], a(2n+1) = 2a(n) + 1. - Ralf Stephan (ralf(AT)ark.in-berlin.de), Sep 16 2003
|
|
EXAMPLE
|
a(22)=14 because starting with 10110 the left rotation produces 01101 written as 1101 (i.e. 13) and the left rotation produces 1110 (i.e. 14)
|
|
CROSSREFS
|
Cf. A006257, A038572.
Sequence in context: A109532 A137338 A058659 this_sequence A152903 A122507 A094250
Adjacent sequences: A053639 A053640 A053641 this_sequence A053643 A053644 A053645
|
|
KEYWORD
|
nonn
|
|
AUTHOR
|
Henry Bottomley (se16(AT)btinternet.com), Mar 22 2000
|
|
|
Search completed in 0.002 seconds
|
