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

 

Logo

Annual Appeal: Please make a donation (tax deductible in USA) to keep the OEIS running. Over 5000 articles have referenced us, often saying "we discovered this result with the help of the OEIS".

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

%I

%S 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,

%T 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,

%U 2,4,3,2,2,2,3,3,3,3,4,3,2,2,2,3,3,2,1,1,2,3

%N a(n)=(greatest base 5 digit of n)-(least base 5 digit of n).

%p A037899 := proc(n)

%p local dgs ;

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

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

%p end proc: # _R. J. Mathar_, Oct 19 2015

%K nonn,base

%O 1,8

%A _Clark Kimberling_

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

License Agreements, Terms of Use, Privacy Policy .

Last modified December 5 07:40 EST 2016. Contains 278761 sequences.