|
Search: id:A067182
|
|
|
| A067182 |
|
Smallest Fibonacci number with digit sum n, or 0 if no such number exists. |
|
+0
1
|
|
| 0, 1, 2, 3, 13, 5, 0, 34, 8, 144, 55, 0, 0, 0, 4181, 0, 0, 89, 0, 2584, 10946, 317811, 1597, 514229, 987, 0, 0, 46368, 28657, 196418, 2178309, 1346269, 0, 701408733, 3524578, 9227465, 0, 5702887, 0, 0, 0, 433494437, 0, 63245986, 39088169, 0, 267914296, 0
(list; graph; listen)
|
|
|
OFFSET
|
0,3
|
|
|
COMMENT
|
The zeros are just conjectures.
|
|
EXAMPLE
|
a(14) =4181, as it is the smallest Fibonacci number with a digit sum of 14. a(6) = 0 as I could not yet find any Fibonacci number with a digit sum= 6..
|
|
CROSSREFS
|
Sequence in context: A051298 A069870 A067180 this_sequence A085402 A085400 A067523
Adjacent sequences: A067179 A067180 A067181 this_sequence A067183 A067184 A067185
|
|
KEYWORD
|
easy,nonn,base
|
|
AUTHOR
|
Amarnath Murthy (amarnath_murthy(AT)yahoo.com), Jan 09 2002
|
|
EXTENSIONS
|
More terms from Frank Ellermann, Jan 18 2002
More terms from Jason Earls (zevi_35711(AT)yahoo.com), May 27 2002
|
|
|
Search completed in 0.002 seconds
|
