This is a front-end for the Online Encyclopedia of Integer Sequences, made by Christian Perfect. The idea is to provide OEIS entries in non-ancient HTML, and then to think about how they're presented visually. The source code is on GitHub.
%I A276739 #17 Oct 08 2016 17:05:43
%S A276739 1,19,10699,102589,10000112389
%N A276739 Least k such that A045876(k) is divisible by 10^n.
%C A276739 Corresponding values of A045876(k) are 1, 110, 3333300, 333333000, ...
%C A276739 Sequence is infinite.
%C A276739 a(5) > 10^18. - _Giovanni Resta_, Sep 27 2016
%C A276739 Subsequence of A179239. - _David A. Corneth_, Oct 01 2016
%e A276739 a(1) = 19 because 19+91 = 110 is divisible by 10.
%t A276739 Table[k = 1; While[! Divisible[Total[FromDigits /@ Permutations@ IntegerDigits@ k], 10^n], k++]; k, {n, 0, 3}] (* _Michael De Vlieger_, Sep 16 2016 *)
%o A276739 (PARI) A047726(n) = n=digits(n); (#n)!/prod(i=0, 9, sum(j=1, #n, n[j]==i)!);
%o A276739 A055642(n) = #Str(n);
%o A276739 A007953(n) = sumdigits(n);
%o A276739 A045876(n) = ((10^A055642(n)-1)/9)*(A047726(n)*A007953(n)/A055642(n));
%o A276739 a(n) = {my(k = 1); while (A045876(k) % (10^n), k++); k;}
%Y A276739 Cf. A045876.
%K A276739 nonn,base,more
%O A276739 0,2
%A A276739 _Altug Alkan_, Sep 16 2016
%E A276739 a(4) from _Giovanni Resta_, Sep 27 2016