A037879 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.

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, 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, 2, 2, 3, 1, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 2, 1, 2, 2, 2, 1, 1, 1

Offset

1,19

Links

Robert Israel, Table of n, a(n) for n = 1..10000

Formula

a(2*n) = a(n). a(2*n+1) is either a(n) or a(n) + 1. - Robert Israel, Feb 08 2019

Maple

A037879 := proc(n)
        local a, dgs, dgsE ;
        a := 0 ;
        dgs := convert(n, base, 2);
        dgsE := sort(dgs) ;
        for i from 1 to nops(dgs) do
                a := a+ abs(op(i, dgs)-op(i, dgsE)) ;
        end do:
        a/2 ;
end proc: # R. J. Mathar, Oct 19 2015

Crossrefs

Sequence in context: A319659 A050372 A037802 * A178535 A025449 A047988

Adjacent sequences: A037876 A037877 A037878 * A037880 A037881 A037882

Keyword

nonn,base

Author

Clark Kimberling

Extensions

Definition swapped with A037870. - R. J. Mathar, Oct 19 2015

Status

approved