This site is supported by donations to The OEIS Foundation.

 Hints (Greetings from The On-Line Encyclopedia of Integer Sequences!)
 A079946 Binary expansion of n has form 11**...*0. 11
 6, 12, 14, 24, 26, 28, 30, 48, 50, 52, 54, 56, 58, 60, 62, 96, 98, 100, 102, 104, 106, 108, 110, 112, 114, 116, 118, 120, 122, 124, 126, 192, 194, 196, 198, 200, 202, 204, 206, 208, 210, 212, 214, 216, 218, 220, 222, 224, 226, 228, 230, 232, 234, 236, 238, 240, 242, 244, 246 (list; graph; refs; listen; history; text; internal format)
 OFFSET 1,1 COMMENTS a(n) = b(n+1), with b(2n) = 2b(n), b(2n+1) = 2b(n)+2+4[n==0]. - Ralf Stephan, Oct 11 2003 LINKS Harvey P. Dale, Table of n, a(n) for n = 1..1000 B. Cloitre, N. J. A. Sloane and M. J. Vandermast, Numerical analogues of Aronson's sequence, J. Integer Seqs., Vol. 6 (2003), #03.2.2. B. Cloitre, N. J. A. Sloane and M. J. Vandermast, Numerical analogues of Aronson's sequence (math.NT/0305308) R. Stephan, Some divide-and-conquer sequences ... R. Stephan, Table of generating functions FORMULA a(n) = 2^floor(log[2](4*n))+2*n. - Antonio G. Astudillo (afg_astudillo(AT)hotmail.com), Feb 22 2003 a(n) = (2^(floor(log(n)/log(2))+1)+n)*2. - Klaus Brockhaus, Feb 23 2003 a(2n) = 2a(n), a(2n+1) = 2a(n) + 2 + 4[n==0]. Twice A004755. - Ralf Stephan, Oct 12 2003 MAPLE A079446 := n -> 2*(2^(1+A000523(n))+n); MATHEMATICA Table[Union[FromDigits[Join[{1, 1}, #, {0}], 2]&/@Tuples[{1, 0}, n]], {n, 0, 5}]//Flatten (* Harvey P. Dale, Jan 16 2018 *) PROG (PARI) for(n=0, 6, for(k=2^(n-1), 2^n-1, print1((2^n+k)*2, ", "))) (PARI) for(n=1, 59, print1((2^(floor(log(n)/log(2))+1)+n)*2, ", ")) CROSSREFS A004755 = union of this and A080565. A057547(n) = a(A014486(n)) for n >= 1. Sequence in context: A315613 A246590 A214399 * A315614 A118586 A293907 Adjacent sequences:  A079943 A079944 A079945 * A079947 A079948 A079949 KEYWORD nonn,easy AUTHOR N. J. A. Sloane, Feb 21 2003 STATUS approved

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Style Sheet | Transforms | Superseeker | Recent
The OEIS Community | Maintained by The OEIS Foundation Inc.

Last modified October 14 00:32 EDT 2019. Contains 327991 sequences. (Running on oeis4.)