This site is supported by donations to The OEIS Foundation.

 Hints (Greetings from The On-Line Encyclopedia of Integer Sequences!)
 A277057 Least k such that n-th repunit times k contains all digits from 1 to 9. 3
 123456789, 11225079, 1113198, 210789, 11115, 11115, 11115, 11115, 11115, 11115, 11115, 11115, 11115, 11115, 11115, 11115, 11115, 11115, 11115, 11115, 11115, 11115, 11115, 11115, 11115, 11115, 11115, 11115, 11115, 11115, 11115, 11115, 11115, 11115, 11115 (list; graph; refs; listen; history; text; internal format)
 OFFSET 1,1 COMMENTS Starting from n=5, a(n)=A277059(10)=11115, and the corresponding pandigital numberss are 123499...98765 (n-4 nines). Actually, for all n, the resulting numbers are zeroless pandigitals. a(1)-a(5) constitute row 10 of A277058. a(n)*A002275(n) is 123456789, 123475869, 123564978, 234186579, 123498765, ... LINKS EXAMPLE a(2) = 11225079 because A002275(2)*11225079 = 11*11225079 = 123475869 that contains all digits from 1 to 9 and 11225079 is the least number with this property. CROSSREFS Cf. A002275, A050289, A277054, A277058, A277059. Sequence in context: A172917 A068247 A224780 * A180408 A050289 A204140 Adjacent sequences:  A277054 A277055 A277056 * A277058 A277059 A277060 KEYWORD nonn,base,easy AUTHOR Andrey Zabolotskiy and Altug Alkan, Sep 26 2016 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 January 24 00:58 EST 2019. Contains 319404 sequences. (Running on oeis4.)