login

Year-end appeal: Please make a donation to the OEIS Foundation to support ongoing development and maintenance of the OEIS. We are now in our 61st year, we have over 378,000 sequences, and we’ve reached 11,000 citations (which often say “discovered thanks to the OEIS”).

A079352
a(1)=1, then a(n)=3*a(n-1) if n is already in the sequence, a(n)=2*a(n-1) otherwise.
2
1, 2, 4, 12, 24, 48, 96, 192, 384, 768, 1536, 4608, 9216, 18432, 36864, 73728, 147456, 294912, 589824, 1179648, 2359296, 4718592, 9437184, 28311552, 56623104, 113246208, 226492416, 452984832, 905969664, 1811939328, 3623878656
OFFSET
1,2
COMMENTS
Inspired by A079000. Cf. A064437.
FORMULA
a(n+1)=3*a(n) for n=3 n of the form 3*2^k - 1, k>=2 . a(n+1)=2*a(n) otherwise. Hence a(n)=3*(3/2)^floor((log(n/3))/log(2))*2^n.
PROG
(PARI) a(n)=3*(3/2)^floor((log(n)-log(3))/log(2))*2^n
CROSSREFS
Sequence in context: A108720 A330592 A089822 * A089888 A291779 A181809
KEYWORD
nonn
AUTHOR
Benoit Cloitre, Feb 14 2003
STATUS
approved