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 A276480 #15 Dec 13 2016 08:27:00
%S A276480 1,6,18,36,72,120,168,288,420,360,792,720,1512,1260,1440,3240,4032,
%T A276480 2880,2520,3960,5544,6720,5040,10920,7560,14400,10080,13860,15840,
%U A276480 15120,18480,20160,37440,25200,46800,30240,36960,32760,27720,71280,50400,69300,60480
%N A276480 a(n) = the smallest number k such that floor(Sum_{d|k} 0.d) = n.
%C A276480 Here 0.d means the decimal fraction obtained by writing d after the decimal point, e.g., 0.12 = 12/100 = 3/25.
%C A276480 a(n) = the smallest number k such that floor (A276466(k)/A276467(k)) = n.
%C A276480 The first few values of Sum_{d|n} 0.d are 1/10, 3/10, 2/5, 7/10, 3/5, 6/5, 4/5, 3/2, 13/10, 9/10, 21/100, 43/25, ...
%H A276480 Chai Wah Wu, <a href="/A276480/b276480.txt">Table of n, a(n) for n = 0..477</a>
%t A276480 Table[k = 1; While[Floor@ Total@ (#*1/10^(1 + Floor@ Log10@ #)) != n &@ Divisors@ k, k++]; k, {n, 0, 40}] (* _Michael De Vlieger_, Sep 06 2016 *)
%o A276480 A276480:=func<n|exists(r){k:k in[1..100000] | Floor(&+[d / (10^(#Intseq(d))): d in Divisors(k)]) eq n}select r else 0>; [A276480(n): n in[0..45]]
%o A276480 (PARI) a(n) = {k = 1; while(floor(sumdiv(k, d, d/10^(#Str(d)))) != n, k++); k; } \\ _Michel Marcus_, Sep 05 2016
%Y A276480 Cf. A276466, A276467, A276479.
%K A276480 nonn,base
%O A276480 0,2
%A A276480 _Jaroslav Krizek_, Sep 05 2016