A367738 a(n) = k is the smallest exponent k such that at least 3 equal decimal digits "n,n,n" appear in the decimal representation of 3^k (n=0,1,...,9).

148, 93, 148, 119, 55, 33, 34, 112, 32, 35

Offset

0,1

Links

Table of n, a(n) for n=0..9.

Mathematica

Table[Module[{k=1}, While[SequenceCount[IntegerDigits[3^k], {n, n, n}]<1, k++]; k], {n, 0, 9}]

Crossrefs

Cf. A171242, A000244, A018802, A171132.

Sequence in context: A097729 A214139 A215656 * A308889 A214619 A061154

Adjacent sequences: A367735 A367736 A367737 * A367739 A367740 A367741

Keyword

nonn,base,fini,full,easy

Author

Harvey P. Dale, Nov 28 2023

Status

approved