|
|
A072351
|
|
Smallest n-digit Fibonacci number.
|
|
12
|
|
|
1, 13, 144, 1597, 10946, 121393, 1346269, 14930352, 102334155, 1134903170, 12586269025, 139583862445, 1548008755920, 10610209857723, 117669030460994, 1304969544928657, 14472334024676221, 160500643816367088, 1100087778366101931, 12200160415121876738
(list;
graph;
refs;
listen;
history;
text;
internal format)
|
|
|
OFFSET
|
1,2
|
|
LINKS
|
|
|
FORMULA
|
|
|
EXAMPLE
|
a(3)=144, as 144 is smallest 3-digit Fibonacci number.
|
|
MAPLE
|
F:= proc(n) option remember; local f;
f:= `if`(n=1, [1$2], F(n-1));
do f:= [f[2], f[1]+f[2]];
if length(f[1])<length(f[2]) then break fi
od; f
end:
a:= n-> `if`(n=1, 1, F(n-1)[2]):
|
|
MATHEMATICA
|
a[n_] := Fibonacci[Ceiling[k /. FindRoot[Log[10, Fibonacci[k]] == n-1, {k, 1}]]]; Array[a, 20] (* Jean-François Alcover, Jan 18 2017 *)
|
|
PROG
|
(Python)
list = [1]
x, y = 1, 1
while len(list) < n:
if len(str(x)) < len(str(y)):
list.append(y)
x, y = y, x + y
return list
|
|
CROSSREFS
|
|
|
KEYWORD
|
base,nonn
|
|
AUTHOR
|
|
|
STATUS
|
approved
|
|
|
|