login
This site is supported by donations to The OEIS Foundation.

 

Logo


Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A079251 Complement of A079000. 1
2, 3, 5, 10, 12, 14, 22, 24, 26, 28, 30, 32, 46, 48, 50, 52, 54, 56, 58, 60, 62, 64, 66, 68, 94, 96, 98, 100, 102, 104, 106, 108, 110, 112, 114, 116, 118, 120, 122, 124, 126, 128, 130, 132, 134, 136, 138, 140, 190, 192, 194, 196, 198, 200, 202, 204 (list; graph; refs; listen; history; text; internal format)
OFFSET

1,1

LINKS

Alois P. Heinz, Table of n, a(n) for n = 1..20000

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)

Ralf Stephan, Some divide-and-conquer sequences ...

Ralf Stephan, Table of generating functions

FORMULA

a(n)=b(n-1)+2, with b(0)=0, b(2n)=2b(n)+1+3[n>1], b(2n+1)=2b(n)+1+5[n>0]. - Ralf Stephan, Oct 07 2003

PROG

(PARI) a(n)=if(n<3, if(n<2, 2, 3), 3*2^floor(log(2/3*(n-1))/log(2))+2*n-4) /* Ralf Stephan */

CROSSREFS

Sequence in context: A249991 A039022 A182402 * A171785 A050051 A252353

Adjacent sequences:  A079248 A079249 A079250 * A079252 A079253 A079254

KEYWORD

nonn

AUTHOR

N. J. A. Sloane, Feb 04 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 | More pages
The OEIS Community | Maintained by The OEIS Foundation Inc.

License Agreements, Terms of Use, Privacy Policy .

Last modified February 21 14:23 EST 2018. Contains 299414 sequences. (Running on oeis4.)