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 A018802 #17 Apr 08 2023 19:01:33
%S A018802 1,2,32,4,512,64,70368744177664,8,9007199254740992,1024,
%T A018802 1125899906842624,128,131072,140737488355328,151115727451828646838272,
%U A018802 16,17179869184,18014398509481984,19342813113834066795298816,2048,2147483648
%N A018802 Smallest power of 2 that begins with n.
%D A018802 A. M. Yaglom and I. M. Yaglom, Challenging Mathematical Problems With Elementary Solutions, Vol. 1 pp. 29, 199-200; Prob. 91a, Dover NY 1987
%H A018802 Christian N. K. Anderson, <a href="/A018802/b018802.txt">Table of n, a(n) for n = 1..981</a> (a(982) has 1196 digits)
%F A018802 a(n) = 2^A018856(n). - _Seiichi Manyama_, Jan 29 2017
%F A018802 a(2^n) = 2^n for n >= 0. - _Seiichi Manyama_, Jan 29 2017
%e A018802 a(7) = 70368744177664, because 2^46 is the smallest power of 2 that begins with a 7.
%o A018802 (R) library(gmp); ndig<-function(i) nchar(as.character(as.bigz(i))) y=as.bigz(rep(0,100)); for(i in 1:100) {n=as.bigz(2); while(substr(n,1,ndig(i))!=as.character(i)) n=n*2; y[i]=n; } # _Christian N. K. Anderson_, May 23 2013
%Y A018802 Cf. A018856.
%Y A018802 Cf. this sequence (k=2), A018857 (k=3), A018859 (k=4), A018861 (k=5), A018863 (k=6), A018865 (k=7), A018867 (k=8), A018869 (k=9).
%K A018802 nonn,base
%O A018802 1,2
%A A018802 _David W. Wilson_