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