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 A049796 #9 Sep 08 2022 08:44:58 %S A049796 1,2,3,4,5,9,16,22,32,39,53,64,79,91,113,124,147,166,188,208,238,256, %T A049796 288,313,344,371,411,434,473,509,548,580,629,657,709,749,796,837,893, %U A049796 928,987,1038,1093,1136,1206,1246,1314,1371,1431 %N A049796 a(n) = T(n,n-4), array T as in A049790. %H A049796 G. C. Greubel, <a href="/A049796/b049796.txt">Table of n, a(n) for n = 5..1000</a> %p A049796 seq( `if`(n<9, n-4, add(floor((n-4)/floor((n-8)/j)), j=1..n-8)), n=5..60); # _G. C. Greubel_, Dec 10 2019 %t A049796 Table[If[n<9, n-4, Sum[Floor[(n-4)/Floor[(n-8)/j]], {j,n-8}]], {n,5,60}] (* _G. C. Greubel_, Dec 10 2019 *) %o A049796 (PARI) a(n) = if(n<9, n-4, sum(j=1,n-8, (n-4)\((n-8)\j)) ); %o A049796 vector(60, n, a(n+4) ) \\ _G. C. Greubel_, Dec 10 2019 %o A049796 (Magma) [n lt 9 select n-4 else (&+[Floor((n-4)/Floor((n-8)/j)): j in [1..n-8]]): n in [5..60]]; // _G. C. Greubel_, Dec 10 2019 %o A049796 (Sage) %o A049796 def a(n): %o A049796 if (n<9): return n-4 %o A049796 else: return sum(floor((n-4)/floor((n-8)/j)) for j in (1..n-8)) %o A049796 [a(n) for n in (5..60)] # _G. C. Greubel_, Dec 10 2019 %o A049796 (GAP) %o A049796 a:= function(n) %o A049796 if n<9 then return n-4; %o A049796 else return Sum([1..n-8], j-> Int((n-4)/Int((n-8)/j)) ); %o A049796 fi; end; %o A049796 List([5..60], n-> a(n) ); # _G. C. Greubel_, Dec 10 2019 %Y A049796 Cf. A049790, A049791, A049792, A049793, A049794, A049795. %K A049796 nonn %O A049796 5,2 %A A049796 _Clark Kimberling_