|
Search: id:A072817
|
|
|
| A072817 |
|
Accumulative sum of the greatest digit of n minus the least digit of n (A037904) <= 10^n. |
|
+0
1
|
|
| 1, 286, 4621, 56980, 640663, 6904678, 72722233, 755339992
(list; graph; listen)
|
|
|
OFFSET
|
1,2
|
|
|
COMMENT
|
Let b(n) = sum( A037904(k),{k=1..n}), then the lim b(n)/n -> 9. Reason, as the number of digits increases, then the likelihood of the maximum digit -> 9 and the minimum digits -> 0 becomes one.
|
|
MATHEMATICA
|
f[n_] := Block[{d = IntegerDigits[n]}, Max[d] - Min[d]]; s = 0; k = 0; Do[ While[k != 10^n, k++; s = s + f[k]]; Print[s], {n, 1, 8}]
|
|
CROSSREFS
|
Cf. A037904.
Sequence in context: A090089 A025384 A027798 this_sequence A117994 A130433 A140926
Adjacent sequences: A072814 A072815 A072816 this_sequence A072818 A072819 A072820
|
|
KEYWORD
|
nonn,base
|
|
AUTHOR
|
Benoit Cloitre (benoit7848c(AT)orange.fr) and Robert G. Wilson v (rgwv(AT)rgwv.com), Aug 09 2002
|
|
|
Search completed in 0.002 seconds
|
