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 A156745 #26 Oct 23 2023 17:58:35
%S A156745 2,5,8,12,15,20,23,28,32,37,40,47,50,55,60,66,69,76,79,86,91,96,99,
%T A156745 108,112,117,122,129,132,141,144,151,156,161,166,176,179,184,189,198,
%U A156745 201,210,213,220,227,232,235,246,250,257,262,269,272,281,286,295,300
%N A156745 a(n) = Sum_{k=1..n} floor((n+k)/k) = n + Sum_{k=1..n} sigma_0(k), where sigma_0(k) is A000005(k). Also a(n) = n + A006218(n).
%C A156745 Generalized sequence b(n) = Sum_{k=1..n} floor((n+k*t)/k) = t*n + Sum_{k=1..n} sigma_0(k), where sigma_0(k) is A000005(k). Also b(n) = t*n + A006218(n).
%C A156745 Partial sums of A334954. - _Omar E. Pol_, Sep 26 2020
%F A156745 a(n) = 2*n + Sum_{k=1..floor(n/2)} floor((n-k)/k). - _Wesley Ivan Hurt_, Dec 25 2020
%F A156745 a(n) = A005843(n) + A002541(n), after _Wesley Ivan Hurt_. - _Omar E. Pol_, Dec 25 2020
%o A156745 (PARI) a(n) = n + sum(k=1, n, numdiv(k)); \\ _Michel Marcus_, Oct 02 2020
%o A156745 (Python)
%o A156745 from math import isqrt
%o A156745 def A156745(n): return n-(s:=isqrt(n))**2+(sum(n//k for k in range(1,s+1))<<1) # _Chai Wah Wu_, Oct 23 2023
%Y A156745 Cf. A000005, A006218, A153818, A118014, A002541, A334954.
%K A156745 easy,nonn
%O A156745 1,1
%A A156745 _Ctibor O. Zizka_, Feb 14 2009
%E A156745 More terms from _Eric M. Schmidt_, Feb 28 2014