|
Search: id:A004759
|
|
|
| A004759 |
|
Binary expansion starts 111. |
|
+0
8
|
|
| 7, 14, 15, 28, 29, 30, 31, 56, 57, 58, 59, 60, 61, 62, 63, 112, 113, 114, 115, 116, 117, 118, 119, 120, 121, 122, 123, 124, 125, 126, 127, 224, 225, 226, 227, 228, 229, 230, 231, 232, 233, 234, 235, 236, 237, 238, 239, 240, 241, 242, 243, 244
(list; graph; listen)
|
|
|
OFFSET
|
1,1
|
|
|
COMMENT
|
This is the minimal recursive sequence such that a(1)=7, A007814(a(n))= A007814(n) and A010060(a(n))=A010060(n). [From Vladimir Shevelev (shevelev(AT)bgu.ac.il), Apr 23 2009]
|
|
FORMULA
|
a(2n) = 2a(n), a(2n+1) = 2a(n) + 1 + 6[n==0].
a(n) = n + 6 * 2^floor(log2(n)) = A004758(n) + A053644(n).
a(n+1)=min{m>a(n): A007814(m)=A007814(n+1) and A010060(m)=A010060(n+1)}. a(2^k)-a(2^k-1)=A103204(k+2),k>=1. [From Vladimir Shevelev (shevelev(AT)bgu.ac.il), Apr 23 2009]
|
|
EXAMPLE
|
30 in binary is 11110, so 30 is in sequence.
|
|
PROGRAM
|
(PARI) a(n)=n+6*2^floor(log(n)/log(2))
|
|
CROSSREFS
|
Cf. A004754 (10), A004755 (11), A004756 (100), A004757 (101), A004758 (110).
Cf. A004760, A053644, A062050, A076877.
A007814 A010060 A103204 A159559 A159560 A159615 A159619 A159629 A159698 [From Vladimir Shevelev (shevelev(AT)bgu.ac.il), Apr 23 2009]
Sequence in context: A085335 A069137 A004781 this_sequence A062056 A115770 A086779
Adjacent sequences: A004756 A004757 A004758 this_sequence A004760 A004761 A004762
|
|
KEYWORD
|
nonn
|
|
AUTHOR
|
N. J. A. Sloane (njas(AT)research.att.com).
|
|
EXTENSIONS
|
Edited by Ralf Stephan (ralf(AT)ark.in-berlin.de), Oct 12 2003
|
|
|
Search completed in 0.003 seconds
|
