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 A276597 #24 Feb 05 2017 07:05:52
%S A276597 1,2,3,4,5,6,7,8,9,19,10,39,49,59,69,79,89,102,199,109,106,13,599,103,
%T A276597 799,139,108,149,2999,104,4999,169,12,179,8999,105,100,289,139,389,
%U A276597 10000,106,79999,13,159,689,299999,107,100006,1789,179,2789,899999,108,14,4789,199,5789,5999999,109
%N A276597 Least k such that n divides A045876(k).
%C A276597 Corresponding values of A045876(a(n))/n are 1, 1, 1, 1, 1, 1, 1, 1, 1, 11, 1, 11, 11, 11, 11, 11, 11, 37, 111, 111, 74, 2, 111, 37, 111, 111, 74, 111, 1111, 37, 1111, 111, 1, 111, 1111, 37, 3, 111, 74, 111, 271, 37, 11111, 1, 74, 111, 111111, 37, 79365, 3333, ...
%H A276597 Giovanni Resta, <a href="/A276597/b276597.txt">Table of n, a(n) for n = 1..150</a>
%e A276597 a(10) = 19 because 19+91 = 110 is divisible by 10.
%e A276597 a(18) = 102 because 12+21+102+120+201+210 is divisible by 18.
%o A276597 (PARI) A047726(n) = n=eval(Vec(Str(n))); (#n)!/prod(i=0, 9, sum(j=1, #n, n[j]==i)!);
%o A276597 A055642(n) = #Str(n);
%o A276597 A007953(n) = sumdigits(n);
%o A276597 A045876(n) = ((10^A055642(n)-1)/9)*(A047726(n)*A007953(n)/A055642(n));
%o A276597 a(n) = {my(k = 1); while (A045876(k) % n, k++); k; }
%Y A276597 Cf. A045876.
%K A276597 nonn,base,easy
%O A276597 1,2
%A A276597 _Altug Alkan_, Sep 08 2016