cp's OEIS Frontend

A072352 a(n) is the largest n-digit Fibonacci number.

%I A072352 #20 Sep 03 2021 17:30:11
%S A072352 8,89,987,6765,75025,832040,9227465,63245986,701408733,7778742049,
%T A072352 86267571272,956722026041,6557470319842,72723460248141,
%U A072352 806515533049393,8944394323791464,99194853094755497,679891637638612258,7540113804746346429,83621143489848422977
%N A072352 a(n) is the largest n-digit Fibonacci number.
%H A072352 Robert Israel, <a href="/A072352/b072352.txt">Table of n, a(n) for n = 1..990</a>
%F A072352 a(n) = A000045(A072353(n)). - _Robert Israel_, Mar 10 2016
%e A072352 a(3)=987, as 987 is largest 3-digit Fibonacci number.
%p A072352 fib:= combinat:-fibonacci:
%p A072352 g:= proc(x) local n;
%p A072352   n:= floor(ln((2*x+1)*sqrt(5)/2)/ln((1+sqrt(5))/2));
%p A072352   if fib(n) > x then while fib(n) > x do n:= n-1 od
%p A072352   elif fib(n+1) <= x then while fib(n+1) <= x do n:= n+1 od
%p A072352   fi;
%p A072352   fib(n)
%p A072352 end:
%p A072352 seq(g(10^n),n=1..50); # _Robert Israel_, Mar 10 2016
%p A072352 # second Maple program:
%p A072352 F:= proc(n) option remember; local f;
%p A072352       f:= `if`(n=1, [1$2], F(n-1));
%p A072352       do f:= [f[2], f[1]+f[2]];
%p A072352          if length(f[1])<length(f[2]) then break fi
%p A072352       od; f
%p A072352     end:
%p A072352 a:= n-> F(n)[1]:
%p A072352 seq(a(n), n=1..25);  # _Alois P. Heinz_, Mar 10 2016
%t A072352 Table[k=1;While[Fibonacci@++k<10^n];Fibonacci[k-1],{n,20}] (* _Giorgos Kalogeropoulos_, Jul 06 2021 *)
%o A072352 (Python)
%o A072352 def A072352_list(n):
%o A072352     list = []
%o A072352     x, y = 1, 1
%o A072352     while len(list) < n:
%o A072352         if len(str(x)) < len(str(y)):
%o A072352             list.append(x)
%o A072352         x, y = y, x + y
%o A072352     return list
%o A072352 print(A072352_list(20)) # _M. Eren Kesim_, Jun 28 2021
%Y A072352 Cf. A000045, A072351, A072353.
%K A072352 base,nonn
%O A072352 1,1
%A A072352 _Shyam Sunder Gupta_, Jul 17 2002