cp's OEIS Frontend

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.

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

Original entry on oeis.org

1, 19, 10699, 102589, 10000112389
Offset: 0

Views

Author

Altug Alkan, Sep 16 2016

Keywords

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

Examples

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

Crossrefs

Cf. A045876.

Programs

  • Mathematica
    Table[k = 1; While[! Divisible[Total[FromDigits /@ Permutations@ IntegerDigits@ k], 10^n], k++]; k, {n, 0, 3}] (* Michael De Vlieger, Sep 16 2016 *)
  • 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;}

Extensions

a(4) from Giovanni Resta, Sep 27 2016