This site is supported by donations to The OEIS Foundation.

 Hints (Greetings from The On-Line Encyclopedia of Integer Sequences!)
 A063566 3^a(n) = smallest positive power of 3 having n in its decimal representation. 4
 10, 4, 3, 1, 5, 8, 8, 3, 4, 2, 21, 19, 17, 22, 11, 13, 17, 11, 7, 9, 18, 7, 19, 13, 5, 26, 19, 3, 24, 6, 16, 12, 13, 31, 15, 21, 24, 29, 18, 31, 17, 12, 18, 5, 12, 28, 16, 11, 15, 10, 35 (list; graph; refs; listen; history; text; internal format)
 OFFSET 0,1 LINKS Harvey P. Dale, Table of n, a(n) for n = 0..1000 EXAMPLE a(7) = 15 because 2^15 = 32768. MATHEMATICA a = {}; Do[k = 1; While[ StringPosition[ ToString[3^k], ToString[n] ] == {}, k++ ]; a = Append[a, k], {n, 0, 50} ]; a sp3[n_]:=Module[{idn=IntegerDigits[n], t=1}, While[!MemberQ[Partition[ IntegerDigits[ 3^t], Length[idn], 1], idn], t++]; t]; Array[sp3, 60, 0] (* Harvey P. Dale, Oct 29 2013 *) CROSSREFS Essentially the same as A062520. Sequence in context: A065194 A113315 A081986 * A153690 A018811 A309707 Adjacent sequences:  A063563 A063564 A063565 * A063567 A063568 A063569 KEYWORD base,nonn AUTHOR Robert G. Wilson v, Aug 10 2001 STATUS approved

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Style Sheet | Transforms | Superseeker | Recent
The OEIS Community | Maintained by The OEIS Foundation Inc.

Last modified October 23 16:46 EDT 2019. Contains 328373 sequences. (Running on oeis4.)