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 A113315 #22 May 26 2024 08:30:11
%S A113315 1,1,1,1,1,1,1,1,1,10,4,2,10,7,4,3,10,4,10,7,5,4,10,6,10,7,10,8,10,9,
%T A113315 7,10,100,34,12,55,37,28,19,13,40,14,22,19,15,28,16,25,19,17,13,18,19,
%U A113315 20,19,16,13,11,100,67,34,23,19,70,24,55,37,28,25,19,46,26,40,27,19,28,29
%N A113315 Niven (or Harshad) numbers A005349 divided by the sum of their digits.
%C A113315 a(n)=10234 is particularly frequent, it is obtained by the following integers: 102340, 133042, 153510, 184212, 204680, 214914, 225148, 235382, 245616, 255850, 266084, 276318, 286552, 327488, 347956, 378658, 388892,.... _Carmine Suriano_, May 04 2013
%H A113315 Carmine Suriano, <a href="/A113315/b113315.txt">Table of n, a(n) for n = 1..10000</a>
%F A113315 a(n) = A005349(n)/A007953(A005349(n)). - _Michel Marcus_, Oct 09 2013
%e A113315 12 is the 11th term of A005349, hence a(11) = 12/(1+2) = 4.
%t A113315 Select[# / DigitSum[#] & /@ Range[300], IntegerQ] (* _Amiram Eldar_, May 26 2024 *)
%o A113315 (PARI) lista(nn) = {for (i = 1, nn, if (i % sumdigits(i) == 0, print1(i/sumdigits(i), ", ")););} \\ _Michel Marcus_, Oct 09 2013
%Y A113315 Cf. A005349 (Niven (or Harshad) numbers: numbers that are divisible by the sum of their digits). Cf. also A066355.
%K A113315 nonn,base
%O A113315 1,10
%A A113315 _Amarnath Murthy_, Dec 20 2001
%E A113315 Corrected, extended and edited by _Zak Seidov_, Oct 26 2005