login
The OEIS Foundation is supported by donations from users of the OEIS and by a grant from the Simons Foundation.

 

Logo


Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A037851 a(n)=Sum{d(i-1)-d(i): d(i)<d(i-1), i=1,...,m}, where Sum{d(i)*10^i: i=0,1,...,m} is the base 10 representation of n. 4
0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 2, 3, 4, 5, 6, 7, 8, 0, 0, 0, 1, 2, 3, 4, 5, 6, 7, 0, 0, 0, 0, 1, 2, 3, 4, 5, 6, 0, 0, 0, 0, 0, 1, 2, 3, 4, 5, 0, 0, 0, 0, 0, 0, 1, 2, 3, 4, 0, 0, 0, 0, 0, 0, 0, 1, 2, 3, 0, 0, 0, 0, 0, 0, 0, 0, 1, 2, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 0 (list; graph; refs; listen; history; text; internal format)
OFFSET

1,13

COMMENTS

This is the base-10 up-variation sequence; see A297330.

LINKS

Clark Kimberling, Table of n, a(n) for n = 1..10000

MAPLE

A037851 := proc(n)

    a := 0 ;

    dgs := convert(n, base, 10);

    for i from 2 to nops(dgs) do

        if op(i, dgs)<op(i-1, dgs) then

            a := a-op(i, dgs)+op(i-1, dgs) ;

        end if;

    end do:

    a ;

end proc: # R. J. Mathar, Oct 19 2015

MATHEMATICA

g[n_, b_] := Differences[IntegerDigits[n, b]]; b = 10; z = 120;

Table[-Total[Select[g[n, b], # < 0 &]], {n, 1, z}];  (*A037860*)

Table[Total[Select[g[n, b], # > 0 &]], {n, 1, z}];   (*A037851*)

CROSSREFS

Cf. A297330, A037860.

Sequence in context: A265540 A075011 A283001 * A037887 A207505 A235049

Adjacent sequences:  A037848 A037849 A037850 * A037852 A037853 A037854

KEYWORD

nonn,base

AUTHOR

Clark Kimberling

EXTENSIONS

Definition swapped with A037860. - R. J. Mathar, Oct 19 2015

Updated by Clark Kimberling, Jan 19 2018

STATUS

approved

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Style Sheet | Transforms | Superseeker | Recent
The OEIS Community | Maintained by The OEIS Foundation Inc.

License Agreements, Terms of Use, Privacy Policy. .

Last modified February 26 12:43 EST 2020. Contains 332280 sequences. (Running on oeis4.)