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 60, we have over 367,000 sequences, and we’ve crossed 11,000 citations (which often say “discovered thanks to the OEIS”). Other ways to Give
 Hints (Greetings from The On-Line Encyclopedia of Integer Sequences!)
 A244927 Least positive number k such that k*n written in base 10 is either a repunit or of the form 1111....0000. 1
 1, 5, 37, 25, 2, 185, 15873, 125, 12345679, 1, 1, 925, 8547, 79365, 74, 625, 65359477124183, 61728395, 5847953216374269, 5, 5291, 5, 48309178743961352657, 4625, 4, 42735, 4115226337448559670781893, 396825 (list; graph; refs; listen; history; text; internal format)
 OFFSET 1,2 LINKS Chai Wah Wu, Table of n, a(n) for n = 1..100 FORMULA a(n) = A244859(n)/n. EXAMPLE For n = 7, 15873*7 = 111111 and this is the least positive multiple of 7 that is either a repunit or of the form 1111...000. CROSSREFS Cf. A244859, A079339, A004290. Equal to A079339 for the first 6 terms. Sequence in context: A157809 A079339 A257343 * A043075 A096673 A144960 Adjacent sequences: A244924 A244925 A244926 * A244928 A244929 A244930 KEYWORD nonn,base AUTHOR Chai Wah Wu, Jul 08 2014 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 09:21 EST 2023. Contains 367516 sequences. (Running on oeis4.)