|
Search: id:A067107
|
|
|
| A067107 |
|
Smallest number whose sum of digits is n!. |
|
+0
1
|
|
| 1, 2, 6, 699, 39999999999999, 99999999999999999999999999999999999999999999999999999999999999999999999999999999
(list; graph; listen)
|
|
|
OFFSET
|
1,2
|
|
|
COMMENT
|
The next term has 560 digits. - Larry Reeves (larryr(AT)acm.org), Apr 03 2002
|
|
FORMULA
|
a(n) = concatenation of (n! mod 9 ) and ( n! div 9 ) nines.
|
|
EXAMPLE
|
a(4) = 699 as 6+9+9 =24= 4!
|
|
CROSSREFS
|
Sequence in context: A132495 A112724 A110795 this_sequence A047690 A113569 A007338
Adjacent sequences: A067104 A067105 A067106 this_sequence A067108 A067109 A067110
|
|
KEYWORD
|
easy,nonn
|
|
AUTHOR
|
Amarnath Murthy (amarnath_murthy(AT)yahoo.com), Jan 07 2002
|
|
EXTENSIONS
|
More terms from Larry Reeves (larryr(AT)acm.org), Apr 03 2002
|
|
|
Search completed in 0.002 seconds
|
