Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A072830
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
%I A072830
%S A072830 9,18,27,36,45,54,63,72,81,88,97,104,109,112,113,112,109,104,97,102,
%T A072830 109,118,125,130,133,134,133,130,125,128,133,140,149,156,161,164,165,
%U A072830 164,161,162,165,170,177,186,193,198,201,202,201,200,201,204,209,216
%N A072830 2*b(n)-9*n, where b(n) = accumulative sum of the greatest digit of n 
               minus the least digit of n (A037904).
%F A072830 Let b(n) = sum( A037904(k), {k=1..n}), a(n) = |2*b(n) - 9*n|.
%t A072830 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}]
%Y A072830 Cf. A037904.
%Y A072830 Sequence in context: A114386 A044894 A052484 this_sequence A008591 A070279 
               A016096
%Y A072830 Adjacent sequences: A072827 A072828 A072829 this_sequence A072831 A072832 
               A072833
%K A072830 nonn,base
%O A072830 1,1
%A A072830 Benoit Cloitre (benoit7848c(AT)orange.fr) and Robert G. Wilson v (rgwv(AT)rgwv.com), 
               Aug 09 2002

    
page 1

Search completed in 0.001 seconds

Lookup | Welcome | Find friends | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Transforms | Puzzles | Hot | Classics
More pages | Superseeker | Maintained by N. J. A. Sloane (njas@research.att.com)

Last modified December 17 13:29 EST 2009. Contains 170826 sequences.


AT&T Labs Research