|
Search: id:A072830
|
|
|
| A072830 |
|
2*b(n)-9*n, where b(n) = accumulative sum of the greatest digit of n minus the least digit of n (A037904). |
|
+0
1
|
|
| 9, 18, 27, 36, 45, 54, 63, 72, 81, 88, 97, 104, 109, 112, 113, 112, 109, 104, 97, 102, 109, 118, 125, 130, 133, 134, 133, 130, 125, 128, 133, 140, 149, 156, 161, 164, 165, 164, 161, 162, 165, 170, 177, 186, 193, 198, 201, 202, 201, 200, 201, 204, 209, 216
(list; graph; listen)
|
|
|
OFFSET
|
1,1
|
|
|
FORMULA
|
Let b(n) = sum( A037904(k), {k=1..n}), a(n) = |2*b(n) - 9*n|.
|
|
MATHEMATICA
|
f[n_] := Block[{d = IntegerDigits[n]}, Max[d] - Min[d]]; b[n_] := b[n] = b[n - 1] + f[n]; b[1] = 0; a[n_] := a[n] = Abs[2b[n] - 9*n]; Table[ a[n], {n, 1, 65}]
|
|
CROSSREFS
|
Cf. A037904.
Sequence in context: A114386 A044894 A052484 this_sequence A008591 A070279 A016096
Adjacent sequences: A072827 A072828 A072829 this_sequence A072831 A072832 A072833
|
|
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
|
