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.

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

This page as a plain text file.
%I A367738 #13 Nov 29 2023 07:42:20
%S A367738 148,93,148,119,55,33,34,112,32,35
%N 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).
%t A367738 Table[Module[{k=1},While[SequenceCount[IntegerDigits[3^k],{n,n,n}]<1,k++];k],{n,0,9}]
%Y A367738 Cf. A171242, A000244, A018802, A171132.
%K A367738 nonn,base,fini,full,easy
%O A367738 0,1
%A A367738 _Harvey P. Dale_, Nov 28 2023