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 A056548 #14 May 03 2019 17:33:56
%S A056548 0,1,4,7,11,15,19,23,29,32,37,43,47,52,58,62,68,73,79,84,90,94,100,
%T A056548 108,112,117,124,128,136,142,146,152,160,165,171,177,183,188,196,202,
%U A056548 208,215,219,227,233,237,247,253,259,263,272,277,283,293,297,303,311,315
%N A056548 a(n) = Sum_{k>=1} round(n/k) where round(1/2) = 0.
%F A056548 a(n) = A056549(n) - A001227(n).
%F A056548 Conjecture: a(n) = Sum_{k=n..2n-1} d(k), where d is the number of divisors function (A000005). - _Ridouane Oudra_, Apr 29 2019
%Y A056548 Cf. A000005, A001227, A006218, A056549.
%K A056548 easy,nonn
%O A056548 0,3
%A A056548 _Henry Bottomley_, Jun 21 2000