A037879 - OEIS

The OEIS is supported by the many generous donors to the OEIS Foundation.

Year-end appeal: Please make a donation to the OEIS Foundation to support ongoing development and maintenance of the OEIS. We are now in our 61st year, we have over 378,000 sequences, and we’ve reached 11,000 citations (which often say “discovered thanks to the OEIS”).

Other ways to Give

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

(list; graph; refs; listen; history; text; internal format)

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