A257259 a(n) = A218542(n) - A218543(n).

1, -1, 0, -1, -1, -3, -1, -6, -8, -10, -7, -4, 2, 2, -14, -90, -318, -896, -2166, -4691, -9298, -17175, -30007, -50261, -81664, -129637, -200973, -301205, -426500, -545183, -561511, -252122, 836543, 3542930, 9312475, 20508985, 40858087, 76119037, 135203839, 232236417, 390709345, 652711050, 1101492173, 1921013671, 3558812217, 7170401227, 15800043812, 37400877416

Offset: 0

Author

Antti Karttunen, May 13 2015

Keywords

• sign

Comments

a(n) = the difference between the number of even and odd numbers encountered when traversing from 2^(n+1)-1 to (2^n)-1 by iterating the map A011371: x -> x - (number of 1's in binary representation of x).

Crossrefs

Cf. A011371, A218542, A218543, A213709.

Partial sums: A257805.

Programs

Scheme

(define (A257259 n) (- (A218542 n) (A218543 n)))

Formula

a(n) = A218542(n) - A218543(n).