Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A079352
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
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. +0
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 (list; graph; listen)
OFFSET

1,2

COMMENT

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.

PROGRAM

(PARI) a(n)=3*(3/2)^floor((log(n)-log(3))/log(2))*2^n

CROSSREFS

Sequence in context: A163908 A108720 A089822 this_sequence A089888 A133411 A004645

Adjacent sequences: A079349 A079350 A079351 this_sequence A079353 A079354 A079355

KEYWORD

nonn

AUTHOR

Benoit Cloitre (benoit7848c(AT)orange.fr), Feb 14 2003

page 1

Search completed in 0.002 seconds

Lookup | Welcome | Find friends | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Transforms | Puzzles | Hot | Classics
More pages | Superseeker | Maintained by N. J. A. Sloane (njas@research.att.com)

Last modified December 1 13:27 EST 2009. Contains 167806 sequences.


AT&T Labs Research