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.

A037898 a(n)=(greatest base 4 digit of n)-(least base 4 digit of n).

Original entry on oeis.org

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

Views

Author

Keywords

Programs

  • Maple
    A037898 := proc(n)
        local dgs ;
        dgs := convert(n,base,4);
        max(op(dgs))-min(op(dgs)) ;
    end proc: # R. J. Mathar, Oct 19 2015
  • Mathematica
    gb4[n_]:=Module[{idn4=IntegerDigits[n,4]},Max[idn4]-Min[idn4]]; Array[ gb4,120] (* Harvey P. Dale, Feb 19 2020 *)