A061249 - OEIS

%I #4 Mar 31 2012 10:22:53

%S 0,1,1,2,3,5,8,49,399,7999,1999999,8999999999,9999999999999999,

%T 89999999999999999999999999,

%U 899999999999999999999999999999999999999999,79999999999999999999999999999999999999999999999999999999999999999999

%N Smallest number with digit sum = Fibonacci(n).

%F 10^floor(fibonacci(n)/9)*(1+fibonacci(n)-9*floor(fibonacci(n)/9)) - 1. - _Sascha Kurz_, Mar 19 2002

%p seq(10^floor(fibonacci(n)/9)-1+10^ floor(fibonacci(n)/9)*(fibonacci(n)-9*floor(fibonacci(n)/9)),n=0..18);

%Y A000045.

%K nonn,base,easy

%O 0,4

%A Benjamin Berardinis (bberard(AT)Adelphia.net), Jun 01 2001

%E More terms from _Sascha Kurz_, Mar 19 2002