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

 

Logo
Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A276739 Least k such that A045876(k) is divisible by 10^n. 0
1, 19, 10699, 102589, 10000112389 (list; graph; refs; listen; history; text; internal format)
OFFSET
0,2
COMMENTS
Corresponding values of A045876(k) are 1, 110, 3333300, 333333000, ...
Sequence is infinite.
a(5) > 10^18. - Giovanni Resta, Sep 27 2016
Subsequence of A179239. - David A. Corneth, Oct 01 2016
LINKS
EXAMPLE
a(1) = 19 because 19+91 = 110 is divisible by 10.
MATHEMATICA
Table[k = 1; While[! Divisible[Total[FromDigits /@ Permutations@ IntegerDigits@ k], 10^n], k++]; k, {n, 0, 3}] (* Michael De Vlieger, Sep 16 2016 *)
PROG
(PARI) A047726(n) = n=digits(n); (#n)!/prod(i=0, 9, sum(j=1, #n, n[j]==i)!);
A055642(n) = #Str(n);
A007953(n) = sumdigits(n);
A045876(n) = ((10^A055642(n)-1)/9)*(A047726(n)*A007953(n)/A055642(n));
a(n) = {my(k = 1); while (A045876(k) % (10^n), k++); k; }
CROSSREFS
Cf. A045876.
Sequence in context: A156973 A270972 A260005 * A093400 A265169 A174306
KEYWORD
nonn,base,more
AUTHOR
Altug Alkan, Sep 16 2016
EXTENSIONS
a(4) from Giovanni Resta, Sep 27 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 | Recents
The OEIS Community | Maintained by The OEIS Foundation Inc.

License Agreements, Terms of Use, Privacy Policy. .

Last modified July 15 03:33 EDT 2024. Contains 374324 sequences. (Running on oeis4.)