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.

A175911 Concatenate the run lengths of the runs of ones and zeros in the binary representation of n in the lowest possible base where it is possible to represent each run length as a single digit. Convert the result to base 10.

This page as a plain text file.
%I A175911 #9 Dec 16 2013 17:04:19
%S A175911 1,3,2,5,7,7,3,7,16,15,14,8,22,13,4,9,29,49,17,41,31,43,23,11,25,67,
%T A175911 23,14,53,21,5,11,46,117,30,50,148,52,27,87,124,63,122,44,130,93,34,
%U A175911 14,45,76,26,68,202,70,39,15,57,213,54,22,106,31,6,13,67,231,47,118,469,121
%N A175911 Concatenate the run lengths of the runs of ones and zeros in the binary representation of n in the lowest possible base where it is possible to represent each run length as a single digit. Convert the result to base 10.
%H A175911 Reinhard Zumkeller, <a href="/A175911/b175911.txt">Table of n, a(n) for n = 1..10000</a>
%t A175911 repcount[x_] := Length/@Split[x]
%t A175911 binrep[x_] := repcount[IntegerDigits[x, 2]]
%t A175911 Table[h = binrep[x]; FromDigits[h, Max[h] + 1], {x, 1, DESIRED_NUMBER_OF_DIGITS}]
%t A175911 f[n_] := Block[{a = Length /@ Split@ IntegerDigits[n, 2]}, FromDigits[a, Max@ a + 1]]; Array[f, 70] (* _Robert G. Wilson v_, Aug 17 2013 *)
%o A175911 (Haskell)
%o A175911 a175911 n = foldl1 (\v d -> b * v + d) rls where
%o A175911    b = maximum rls + 1
%o A175911    rls = a101211_row n
%o A175911 -- _Reinhard Zumkeller_, Dec 16 2013
%Y A175911 Cf. A043276.
%Y A175911 Cf. A101211, A233836.
%K A175911 base,easy,nonn
%O A175911 1,2
%A A175911 _Dylan Hamilton_, Oct 14 2010