cp's OEIS Frontend

This is a front-end for the Online Encyclopedia of Integer Sequences, made by Christian Perfect. The idea is to provide OEIS entries in non-ancient HTML, and then to think about how they're presented visually. The source code is on GitHub.

A037846 a(n)=Sum{d(i-1)-d(i): d(i)

Original entry on oeis.org

0, 0, 0, 0, 0, 0, 1, 2, 3, 0, 0, 0, 1, 2, 0, 0, 0, 0, 1, 0, 0, 0, 0, 0, 0, 1, 2, 3, 4, 0, 0, 1, 2, 3, 1, 1, 1, 2, 3, 2, 2, 2, 2, 3, 3, 3, 3, 3, 3, 0, 1, 2, 3, 4, 0, 0, 1, 2, 3, 0, 0, 0, 1, 2, 1, 1, 1, 1, 2, 2, 2, 2, 2, 2, 0, 1, 2, 3, 4, 0, 0, 1, 2, 3, 0, 0, 0, 1, 2, 0
Offset: 1

Views

Author

Keywords

Comments

This is the base-5 up-variation sequence; see A297330. - Clark Kimberling, Jan 19 2017

Crossrefs

Cf. A297330.

Programs

  • Maple
    A037846 := proc(n)
        a := 0 ;
        dgs := convert(n,base,5);
        for i from 2 to nops(dgs) do
            if op(i,dgs)R. J. Mathar, Oct 19 2015
  • Mathematica
    g[n_, b_] := Differences[IntegerDigits[n, b]]; b = 5; z = 120;
    Table[-Total[Select[g[n, b], # < 0 &]], {n, 1, z}];  (*A037855*)
    Table[Total[Select[g[n, b], # > 0 &]], {n, 1, z}];   (*A037846*)

Extensions

Definition swapped with A037855. - R. J. Mathar, Oct 19 2015
Updated by Clark Kimberling, Jan 19 2018