A367738 - OEIS

%I #13 Nov 29 2023 07:42:20

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

%N 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).

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

%Y Cf. A171242, A000244, A018802, A171132.

%K nonn,base,fini,full,easy

%O 0,1

%A _Harvey P. Dale_, Nov 28 2023