login
The OEIS Foundation is supported by donations from users of the OEIS and by a grant from the Simons Foundation.

 

Logo


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 numbers 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

Table of n, a(n) for n=1..35.

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.

PROG

(PARI) isok(n) = my(d=digits(n)); vecmin(d) && (#Set(digits(n)) == 9);

a(n) = {if (n==1, return(123456789)); my(k=1); while(! isok(k*(10^n - 1)/9), k++); k; } \\ Michel Marcus, Sep 26 2019

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.

License Agreements, Terms of Use, Privacy Policy. .

Last modified March 29 19:35 EDT 2020. Contains 333117 sequences. (Running on oeis4.)