%I #18 Feb 11 2019 01:42:23

%S 0,0,0,0,1,0,0,0,1,1,1,0,1,0,0,0,1,1,2,1,1,1,1,0,1,1,1,0,1,0,0,0,1,1,

%T 2,1,2,2,2,1,1,1,2,1,1,1,1,0,1,1,2,1,1,1,1,0,1,1,1,0,1,0,0,0,1,1,2,1,

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

%N a(n) = (1/2)*Sum{|d(i)-e(i)|} where Sum{d(i)*2^i} is the base-2 representation of n and {e(i)} are digits {d(i)} in nondecreasing order.

%H Robert Israel, <a href="/A037879/b037879.txt">Table of n, a(n) for n = 1..10000</a>

%F a(2*n) = a(n). a(2*n+1) is either a(n) or a(n) + 1. - _Robert Israel_, Feb 08 2019

%p A037879 := proc(n)

%p local a,dgs,dgsE ;

%p a := 0 ;

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

%p dgsE := sort(dgs) ;

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

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

%p end do:

%p a/2 ;

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

%K nonn,base

%O 1,19

%A _Clark Kimberling_

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