Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

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

0,2

FORMULA

a(n) = 2^floor[n*log2(3)] =A000079(A056576(n)) =A000244(n)-A056577(n).

EXAMPLE

a(4)=64 since 3^4=81 and 64<=81<128.

CROSSREFS

Cf. A022921.

Sequence in context: A066792 A096195 A094014 this_sequence A100736 A099888 A046161

Adjacent sequences: A098229 A098230 A098231 this_sequence A098233 A098234 A098235

KEYWORD

easy,nonn

AUTHOR

Henry Bottomley (se16(AT)btinternet.com), Oct 25 2004

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 17 23:40 EST 2009. Contains 171025 sequences.


AT&T Labs Research