cp's OEIS Frontend

This is a front-end for the Online Encyclopedia of Integer Sequences, made by Christian Perfect. The idea is to provide OEIS entries in non-ancient HTML, and then to think about how they're presented visually. The source code is on GitHub.

A179821 In binary representation of n: replace all blocks of k contiguous ones with binary representation of k.

Original entry on oeis.org

0, 1, 2, 2, 4, 5, 4, 3, 8, 9, 10, 10, 8, 9, 6, 4, 16, 17, 18, 18, 20, 21, 20, 11, 16, 17, 18, 18, 12, 13, 8, 5, 32, 33, 34, 34, 36, 37, 36, 19, 40, 41, 42, 42, 40, 41, 22, 20, 32, 33, 34, 34, 36, 37, 36, 19, 24, 25, 26, 26, 16, 17, 10, 6, 64, 65, 66, 66, 68, 69, 68, 35, 72, 73, 74, 74
Offset: 0

Views

Author

Reinhard Zumkeller, Jul 31 2010

Keywords

Comments

a(n) <= n:
a(A003714(n)) = A003714(n); a(A004780(n)) < A004780(n);
A090077(n) <= a(n).

Examples

			n=45->101101->[1]0[11]0[1]->[1]0[2]0[1]->[1]0[10]0[1]->101001->a(45)=41.
		

Crossrefs

Formula

a(2*n) = 2*a(n); a(4*n+1) = 4*a(n)+1.