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

 

Logo


Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A037855 Sum{d(i)-d(i-1): d(i)>d(i-1), i=1,...,m}, where Sum{d(i)*5^i: i=0,1,...,m} is base 5 representation of n. 3

%I

%S 0,0,0,0,1,0,0,0,0,2,1,0,0,0,3,2,1,0,0,4,3,2,1,0,1,1,1,1,1,1,0,0,0,0,

%T 2,1,0,0,0,3,2,1,0,0,4,3,2,1,0,2,2,2,2,2,2,1,1,1,1,2,1,0,0,0,3,2,1,0,

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

%N Sum{d(i)-d(i-1): d(i)>d(i-1), i=1,...,m}, where Sum{d(i)*5^i: i=0,1,...,m} is base 5 representation of n.

%p A037855 := proc(n)

%p a := 0 ;

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

%p for i from 2 to nops(dgs) do

%p if op(i,dgs)>op(i-1,dgs) then

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

%p end if;

%p end do:

%p a ;

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

%K nonn,base

%O 1,10

%A _Clark Kimberling_

%E Definition swapped with A037846. - _R. J. Mathar_, Oct 19 2015

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 September 19 11:26 EDT 2019. Contains 327193 sequences. (Running on oeis4.)