A284579 Carryless base-2 product (A048720) of run lengths in binary representation of n.

1, 1, 1, 2, 2, 1, 2, 3, 3, 2, 1, 2, 4, 2, 3, 4, 4, 3, 2, 4, 2, 1, 2, 3, 6, 4, 2, 4, 6, 3, 4, 5, 5, 4, 3, 6, 4, 2, 4, 6, 3, 2, 1, 2, 4, 2, 3, 4, 8, 6, 4, 8, 4, 2, 4, 6, 5, 6, 3, 6, 8, 4, 5, 6, 6, 5, 4, 8, 6, 3, 6, 5, 6, 4, 2, 4, 8, 4, 6, 8, 4, 3, 2, 4, 2, 1, 2, 3, 6, 4, 2, 4, 6, 3, 4, 5, 10, 8, 6, 12, 8, 4, 8, 12, 6, 4, 2, 4, 8, 4, 6, 8, 12, 5, 6, 12, 6, 3, 6

Offset: 0

Author

Antti Karttunen, Apr 14 2017

Keywords

• nonn
• base

Examples

			For n=56, A007088(56) = "111000" in binary, we do carryless multiplication (in base-2) of 3 and 3, thus a(56) = A048720(3,3) = 5.
		

Links

• Antti Karttunen, Table of n, a(n) for n = 0..10922
• Index entries for sequences related to binary expansion of n

Crossrefs

Cf. A000975 (positions of ones).

Cf. A007088, A048720, A284580, A284581.

Differs from A167489 for the first time at n=56, where a(56) = 5, while A167489(56) = 9.

Programs

Scheme

(define (A284579 n) (reduce A048720bi 1 (binexp->runcount1list n))) ;; Where A048720bi is a two-argument function implementing carryless binary product, A048720. For binexp->runcount1list see A167489.

Formula

A284581(n) = n - a(n).