|
Search: id:A061249
|
|
|
| A061249 |
|
Smallest number with digit sum = Fibonacci(n). |
|
+0
1
|
|
| 0, 1, 1, 2, 3, 5, 8, 49, 399, 7999, 1999999, 8999999999, 9999999999999999, 89999999999999999999999999, 899999999999999999999999999999999999999999, 79999999999999999999999999999999999999999999999999999999999999999999
(list; graph; listen)
|
|
|
OFFSET
|
0,4
|
|
|
FORMULA
|
10^floor(fibonacci(n)/9)*(1+fibonacci(n)-9*floor(fibonacci(n)/9)) - 1. - Sascha Kurz (sascha.kurz(AT)uni-bayreuth.de), 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
|
A000045.
Sequence in context: A128485 A042471 A041871 this_sequence A042237 A042937 A045504
Adjacent sequences: A061246 A061247 A061248 this_sequence A061250 A061251 A061252
|
|
KEYWORD
|
nonn,base,easy
|
|
AUTHOR
|
Benjamin Berardinis (bberard(AT)Adelphia.net), Jun 01 2001
|
|
EXTENSIONS
|
More terms from Sascha Kurz (sascha.kurz(AT)uni-bayreuth.de), Mar 19 2002
|
|
|
Search completed in 0.002 seconds
|
