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 A073557 #15 Dec 04 2024 13:51:40
%S A073557 3,30,301,3011,30103,301031,3010300,30103001,301029995,3010299957,
%T A073557 30102999568
%N A073557 Number of Fibonacci numbers F(k), k <= 10^n, whose initial digit is 1.
%F A073557 Limit_{n->infinity} a(n)/10^n = log(2), where the base is 10. - _Robert Gerbicz_, Sep 05 2002
%e A073557 a(2) = 30 because there are 30 Fibonacci numbers up to 10^2 whose initial digit is 1.
%o A073557 (PARI) default(realprecision, 10^4); m=log((1+sqrt(5))/2);
%o A073557 lista(nn) = {my(d=log(10)/m, r=log(sqrt(5))/m, s=log(5-sqrt(5))/m, t=0, u=1); for(n=1, nn, u=10*u; while(s<u, if(floor(r+=d)==floor(s+=d), t++, t+=2)); print1(t+(r<u||floor(r)==floor(s)), ", ")); } \\ _Jinyuan Wang_, Feb 21 2020
%Y A073557 Cf. A000045, A047855 (numbers of integers <= 10^n, whose initial digit is 1).
%K A073557 nonn,base,more
%O A073557 1,1
%A A073557 _Shyam Sunder Gupta_, Aug 15 2002
%E A073557 More terms from _Robert Gerbicz_, Sep 05 2002
%E A073557 a(9)-a(10) from _Jinyuan Wang_, Feb 21 2020
%E A073557 a(11) from _Sean A. Irvine_, Dec 04 2024