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 A276596 #46 Sep 17 2016 13:04:33
%S A276596 1,10,100,1000,10000,101,1000000,1001
%N A276596 Least k such that A276502(k) = n.
%o A276596 (PARI) A047726(n) = n=eval(Vec(Str(n))); (#n)!/prod(i=0, 9, sum(j=1, #n, n[j]==i)!);
%o A276596 A055642(n) = #Str(n);
%o A276596 A007953(n) = sumdigits(n);
%o A276596 A045876(n) = ((10^A055642(n)-1)/9)*(A047726(n)*A007953(n)/A055642(n));
%o A276596 A276502(n) = {my(k = 1); while (A045876(n*(10^k)) % A045876(n), k++); k; }
%o A276596 a(n) = {my(k = 1); while (A276502(k) != n, k++); k; }
%Y A276596 Cf. A276502.
%K A276596 nonn,base,more
%O A276596 1,2
%A A276596 _Altug Alkan_, Sep 11 2016