S000171


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

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

0

S000171

Sequence S000172 gives the length of the run in 3^n.

T. D. Noe, Plot of 1001 terms

T. D. Noe, Table of 1001 terms

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

Cf. S000169-S000172.

nonn,base

T. D. Noe, Aug 06 2014

© Tony D Noe 2014-2015