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!)
A073557 Number of Fibonacci numbers F(k), k <= 10^n, whose initial digit is 1. 1
3, 30, 301, 3011, 30103, 301031, 3010300, 30103001, 301029995, 3010299957 (list; graph; refs; listen; history; text; internal format)
OFFSET
1,1
LINKS
FORMULA
Limit_{n->infinity} a(n)/10^n = log(2), where the base is 10. - Robert Gerbicz, Sep 05 2002
EXAMPLE
a(2) = 30 because there are 30 Fibonacci numbers up to 10^2 whose initial digit is 1.
PROG
(PARI) default(realprecision, 10^4); m=log((1+sqrt(5))/2);
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
CROSSREFS
Cf. A000045, A047855 (numbers of integers <= 10^n, whose initial digit is 1).
Sequence in context: A136947 A093138 A361896 * A037764 A037652 A037771
KEYWORD
nonn,base,more
AUTHOR
Shyam Sunder Gupta, Aug 15 2002
EXTENSIONS
More terms from Robert Gerbicz, Sep 05 2002
a(9)-a(10) from Jinyuan Wang, Feb 21 2020
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 April 18 11:52 EDT 2024. Contains 371779 sequences. (Running on oeis4.)