|
%I #13 Jun 29 2018 02:10:06
%S 1,2,10,30,35,36,49,83,102,121,111,179,174,203,176,153,200,234,270,
%T 277,258,220,380,278,374,323,459,445,417,507,528,467,602,535,609,605,
%U 570,571,582,599,600,620,768,702,771,724,719,733,797,870,872
%N Smallest k such that 3^k has exactly n 9's in its decimal representation.
%H Harry J. Smith, <a href="/A063564/b063564.txt">Table of n, a(n) for n = 0..150</a>
%t a = {}; Do[k = 1; While[ Count[ IntegerDigits[3^k], 9] != n, k++ ]; a = Append[a, k], {n, 0, 50} ]; a
%o (PARI) a(n)={my(k=1); while(n<>#select(d->d==9, digits(3^k)), k++); k} \\ _Harry J. Smith_, Aug 26 2009, _Andrew Howroyd_, Jun 28 2018
%K base,nonn
%O 0,2
%A _Robert G. Wilson v_, Aug 10 2001
%E Name corrected by _Jon E. Schoenfield_, Jun 26 2018
|
