login
A061249
Smallest number with digit sum = Fibonacci(n).
0
0, 1, 1, 2, 3, 5, 8, 49, 399, 7999, 1999999, 8999999999, 9999999999999999, 89999999999999999999999999, 899999999999999999999999999999999999999999, 79999999999999999999999999999999999999999999999999999999999999999999
OFFSET
0,4
FORMULA
10^floor(fibonacci(n)/9)*(1+fibonacci(n)-9*floor(fibonacci(n)/9)) - 1. - Sascha Kurz, Mar 19 2002
MAPLE
seq(10^floor(fibonacci(n)/9)-1+10^ floor(fibonacci(n)/9)*(fibonacci(n)-9*floor(fibonacci(n)/9)), n=0..18);
CROSSREFS
KEYWORD
nonn,base,easy
AUTHOR
Benjamin Berardinis (bberard(AT)Adelphia.net), Jun 01 2001
EXTENSIONS
More terms from Sascha Kurz, Mar 19 2002
STATUS
approved