S000167


The digit in the longest run in the decimal form of 2^n; the least one if there are duplicates.

1, 2, 4, 8, 1, 2, 4, 1, 2, 1, 0, 0, 0, 1, 1, 2, 5, 0, 4, 8, 0, 0, 0, 8, 7, 3, 8, 7, 2, 0, 0, 1, 2, 9, 1, 3, 1, 1, 4, 8, 7, 5, 1, 2, 4, 8, 4, 5, 0, 9, 9, 2, 9, 0, 0, 0, 0, 1, 1, 8, 1, 0, 1, 2, 4, 8, 0, 1, 0, 0, 1, 1, 2, 4, 8, 7, 5, 1, 2, 4, 0, 2, 6, 3, 1, 2, 1

0

S000167

Sequence S000168 gives the length of the run in 2^n.

T. D. Noe, Plot of 1001 terms

T. D. Noe, Table of 1001 terms

(Mma) t = Table[s = Sort[Split[IntegerDigits[2^n]]]; len = Length[s[[-1]]]; u = Flatten[Select[s, Length[#] == len &, 1]]; {u[[1]], Length[u]}, {n, 0, 100}]; Transpose[t][[1]]

Cf. S000165-S000168A045875.

nonn,base

T. D. Noe, Jul 25 2014

© Tony D Noe 2014-2015