The OEIS is supported by the many generous donors to the OEIS Foundation.

 Year-end appeal: Please make a donation to the OEIS Foundation to support ongoing development and maintenance of the OEIS. We are now in our 59th year, we have over 358,000 sequences, and we’ve crossed 10,300 citations (which often say “discovered thanks to the OEIS”). Other ways to Give
 Hints (Greetings from The On-Line Encyclopedia of Integer Sequences!)
 A217618 A217578(n)/n. 1
 3, 2, 3, 2, 3, 4, 5, 3, 11, 2, 3, 2, 3, 2, 5, 3, 3, 16, 3, 2, 15, 2, 5, 2, 3, 8, 5, 3, 11, 2, 3, 2, 3, 2, 5, 8, 3, 6, 3, 2, 13, 2, 13, 2, 3, 10, 11, 5, 11, 4, 3, 4, 3, 9, 13, 4, 3, 7, 3, 4, 13, 4, 5, 7, 3, 4, 5, 3, 11, 4, 5, 4, 7, 3, 5, 3, 7, 6, 5, 3, 17, 3 (list; graph; refs; listen; history; text; internal format)
 OFFSET 1,1 COMMENTS Inspired by Problem 300 in Mathematical Excalibur, Vol. 13, No. 1, February-April, 2008. LINKS Michel Marcus, Table of n, a(n) for n = 1..1000 EXAMPLE For n=5, odd, 5*2=10, 5*3=15, so 3 is the smallest k such that all digits of 5*k are odd. For n=8, even, 8*2=16, 8*3=24, so 3 is the smallest k such that all digits of 8*k are even. MATHEMATICA Table[k = 2; While[d = IntegerDigits[k*n]; If[OddQ[n], done = And @@ OddQ[d], done = And @@ EvenQ[d]]; ! done, k++]; k, {n, 100}] (* T. D. Noe, Oct 10 2012 *) CROSSREFS Sequence in context: A316290 A029211 A246925 * A018837 A097618 A039639 Adjacent sequences: A217615 A217616 A217617 * A217619 A217620 A217621 KEYWORD nonn AUTHOR Michel Marcus, Oct 09 2012 STATUS approved

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

Last modified December 2 20:59 EST 2022. Contains 358510 sequences. (Running on oeis4.)