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.

A175358 Irregular array read by rows: Row n contains A043276(n) terms. a(n,m) = number of runs (of either 0 or 1) of length m in the binary representation of n.

Original entry on oeis.org

1, 2, 0, 1, 1, 1, 3, 1, 1, 0, 0, 1, 1, 0, 1, 2, 1, 4, 2, 1, 0, 2, 2, 1, 1, 0, 1, 0, 0, 0, 1, 1, 0, 0, 1, 2, 0, 1, 3, 1, 1, 2, 3, 1, 5, 3, 1, 2, 0, 1, 0, 1, 1, 1, 2, 3, 1, 1, 2, 0, 1, 1, 2, 0, 1, 1, 0, 0, 1, 0, 0, 0, 0, 1, 1, 0, 0, 0, 1, 2, 0, 0, 1, 3, 0, 1, 1
Offset: 1

Views

Author

Leroy Quet, Apr 22 2010

Keywords

Examples

			23 in binary is 10111. There are two runs of length 1, zero runs of length 2, and one run of length 3. So, row 23 is (2,0,1).
		

Crossrefs

Programs

  • PARI
    row(n) = my (r=[]); while (n, my (v=valuation(n+(n%2),2)); r = concat(v, r); n\=2^v); my (f=vector(vecmax(r))); for (i=1, #r, f[r[i]]++); f \\ Rémy Sigrist, Feb 13 2019

Extensions

More terms from Rémy Sigrist, Feb 13 2019