This is a front-end for the Online Encyclopedia of Integer Sequences, made by Christian Perfect. The idea is to provide OEIS entries in non-ancient HTML, and then to think about how they're presented visually. The source code is on GitHub.
%I A098232 #17 Sep 06 2022 10:30:39 %S A098232 1,2,8,16,64,128,512,2048,4096,16384,32768,131072,524288,1048576, %T A098232 4194304,8388608,33554432,67108864,268435456,1073741824,2147483648, %U A098232 8589934592,17179869184,68719476736,274877906944,549755813888,2199023255552,4398046511104,17592186044416 %N A098232 Largest power of 2 <= 3^n. %F A098232 a(n) = 2^floor(n*log_2(3)) = A000079(A056576(n)) = A000244(n)-A056577(n). %e A098232 a(4)=64 since 3^4=81 and 64 <= 81 < 128. %p A098232 A098232:=n->2^floor(n*log[2](3)): seq(A098232(n), n=0..30); # _Wesley Ivan Hurt_, Mar 12 2015 %o A098232 (PARI) a(n) = 2^logint(3^n, 2); \\ _Michel Marcus_, Sep 06 2022 %Y A098232 Cf. A000079, A000244, A020857, A022921, A056576, A056577. %K A098232 easy,nonn %O A098232 0,2 %A A098232 _Henry Bottomley_, Oct 25 2004