login
The OEIS is supported by the many generous donors to the OEIS Foundation.

 

Logo
Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A098232 Largest power of 2 <= 3^n. 1
1, 2, 8, 16, 64, 128, 512, 2048, 4096, 16384, 32768, 131072, 524288, 1048576, 4194304, 8388608, 33554432, 67108864, 268435456, 1073741824, 2147483648, 8589934592, 17179869184, 68719476736, 274877906944, 549755813888, 2199023255552, 4398046511104, 17592186044416 (list; graph; refs; listen; history; text; internal format)
OFFSET
0,2
LINKS
FORMULA
a(n) = 2^floor(n*log_2(3)) = A000079(A056576(n)) = A000244(n)-A056577(n).
EXAMPLE
a(4)=64 since 3^4=81 and 64 <= 81 < 128.
MAPLE
A098232:=n->2^floor(n*log[2](3)): seq(A098232(n), n=0..30); # Wesley Ivan Hurt, Mar 12 2015
PROG
(PARI) a(n) = 2^logint(3^n, 2); \\ Michel Marcus, Sep 06 2022
CROSSREFS
Sequence in context: A066792 A096195 A094014 * A354275 A195798 A100736
KEYWORD
easy,nonn
AUTHOR
Henry Bottomley, Oct 25 2004
STATUS
approved

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

License Agreements, Terms of Use, Privacy Policy. .

Last modified March 29 11:14 EDT 2024. Contains 371278 sequences. (Running on oeis4.)