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

%I #17 Oct 08 2016 17:05:43

%S 1,19,10699,102589,10000112389

%N Least k such that A045876(k) is divisible by 10^n.

%C Corresponding values of A045876(k) are 1, 110, 3333300, 333333000, ...

%C Sequence is infinite.

%C a(5) > 10^18. - _Giovanni Resta_, Sep 27 2016

%C Subsequence of A179239. - _David A. Corneth_, Oct 01 2016

%e a(1) = 19 because 19+91 = 110 is divisible by 10.

%t Table[k = 1; While[! Divisible[Total[FromDigits /@ Permutations@ IntegerDigits@ k], 10^n], k++]; k, {n, 0, 3}] (* _Michael De Vlieger_, Sep 16 2016 *)

%o (PARI) A047726(n) = n=digits(n); (#n)!/prod(i=0, 9, sum(j=1, #n, n[j]==i)!);

%o A055642(n) = #Str(n);

%o A007953(n) = sumdigits(n);

%o A045876(n) = ((10^A055642(n)-1)/9)*(A047726(n)*A007953(n)/A055642(n));

%o a(n) = {my(k = 1); while (A045876(k) % (10^n), k++); k;}

%Y Cf. A045876.

%K nonn,base,more

%O 0,2

%A _Altug Alkan_, Sep 16 2016

%E a(4) from _Giovanni Resta_, Sep 27 2016

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 August 13 12:59 EDT 2024. Contains 375142 sequences. (Running on oeis4.)