The OEIS is supported by the many generous donors to the OEIS Foundation.

 Hints (Greetings from The On-Line Encyclopedia of Integer Sequences!)
 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 (list; graph; refs; listen; history; text; internal format)
 OFFSET 0,4 LINKS Table of n, a(n) for n=0..15. 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 A000045. Sequence in context: A128485 A042471 A041871 * A042237 A042937 A045504 Adjacent sequences: A061246 A061247 A061248 * A061250 A061251 A061252 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

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Style Sheet | Transforms | Superseeker | Recents
The OEIS Community | Maintained by The OEIS Foundation Inc.

Last modified July 17 05:50 EDT 2024. Contains 374360 sequences. (Running on oeis4.)