login
This site is supported by donations to The OEIS Foundation.

 

Logo


Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A037899 a(n)=(greatest base 5 digit of n)-(least base 5 digit of n). 1
0, 0, 0, 0, 1, 0, 1, 2, 3, 2, 1, 0, 1, 2, 3, 2, 1, 0, 1, 4, 3, 2, 1, 0, 1, 1, 2, 3, 4, 1, 0, 1, 2, 3, 2, 1, 1, 2, 3, 3, 2, 2, 2, 3, 4, 3, 3, 3, 3, 2, 2, 2, 3, 4, 2, 1, 1, 2, 3, 2, 1, 0, 1, 2, 3, 2, 1, 1, 2, 4, 3, 2, 2, 2, 3, 3, 3, 3, 4, 3, 2, 2, 2, 3, 3, 2, 1, 1, 2, 3 (list; graph; refs; listen; history; text; internal format)
OFFSET

1,8

LINKS

Table of n, a(n) for n=1..90.

MAPLE

A037899 := proc(n)

    local dgs ;

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

    max(op(dgs))-min(op(dgs)) ;

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

CROSSREFS

Sequence in context: A020990 A260686 A037891 * A037837 A194526 A165033

Adjacent sequences:  A037896 A037897 A037898 * A037900 A037901 A037902

KEYWORD

nonn,base

AUTHOR

Clark Kimberling

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 23 02:29 EST 2019. Contains 320411 sequences. (Running on oeis4.)