This site is supported by donations to The OEIS Foundation.

 Hints (Greetings from The On-Line Encyclopedia of Integer Sequences!)
 A244859 Least positive multiple of n which when written in base 10 is either a repunit or of the form 1111....0000. 2
 0, 1, 10, 111, 100, 10, 1110, 111111, 1000, 111111111, 10, 11, 11100, 111111, 1111110, 1110, 10000, 1111111111111111, 1111111110, 111111111111111111, 100, 111111, 110, 1111111111111111111111, 111000, 100 (list; graph; refs; listen; history; text; internal format)
 OFFSET 0,3 LINKS Robert Israel, Table of n, a(n) for n = 0..936 (n = 0..100 from Chai Wah Wu). Chai Wah Wu, Pigeonholes and repunits, Amer. Math. Monthly, 121 (2014), 529-533. MAPLE A244859:= proc(n) local m, d2, d5; d2:= padic:-ordp(n, 2); d5:= padic:-ordp(n, 5); m:= n/2^d2/5^d5; 10^max(d2, d5)*(10^numtheory:-order(10, 9*m)-1)/9 end proc: A244859(0):= 0: seq(A244859(n), n= 0..100); # Robert Israel, Jul 08 2014 CROSSREFS Equal to A004290 for the first 7 terms. Sequence in context: A228006 A004290 A257344 * A159551 A105991 A284352 Adjacent sequences:  A244856 A244857 A244858 * A244860 A244861 A244862 KEYWORD nonn,base AUTHOR Chai Wah Wu, Jul 07 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 | Recent
The OEIS Community | Maintained by The OEIS Foundation Inc.

Last modified September 17 22:53 EDT 2019. Contains 327147 sequences. (Running on oeis4.)