cp's OEIS Frontend

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.

A049795 a(n) = T(n,n-3), array T as in A049790.

This page as a plain text file.
%I A049795 #9 Sep 08 2022 08:44:58
%S A049795 1,2,3,4,7,14,18,29,35,49,57,74,84,105,115,140,155,180,195,228,244,
%T A049795 278,296,332,356,397,416,460,487,534,559,612,637,691,722,779,814,872,
%U A049795 901,968,1007,1073,1107,1180,1218,1292,1333,1407
%N A049795 a(n) = T(n,n-3), array T as in A049790.
%H A049795 G. C. Greubel, <a href="/A049795/b049795.txt">Table of n, a(n) for n = 4..1000</a>
%p A049795 seq( `if`(n<7, n-3, add(floor((n-3)/floor((n-6)/j)), j=1..n-6)), n=4..60); # _G. C. Greubel_, Dec 10 2019
%t A049795 Table[If[n<7, n-3, Sum[Floor[(n-3)/Floor[(n-6)/j]], {j,n-6}]], {n,4,60}] (* _G. C. Greubel_, Dec 10 2019 *)
%o A049795 (PARI) a(n) = if(n<7, n-3, sum(j=1,n-6, (n-3)\((n-6)\j)) );
%o A049795 vector(60, n, a(n+3) ) \\ _G. C. Greubel_, Dec 10 2019
%o A049795 (Magma) [n lt 7 select n-3 else (&+[Floor((n-3)/Floor((n-6)/j)): j in [1..n-6]]): n in [4..60]]; // _G. C. Greubel_, Dec 10 2019
%o A049795 (Sage)
%o A049795 def a(n):
%o A049795     if (n<7): return n-3
%o A049795     else: return sum(floor((n-3)/floor((n-6)/j)) for j in (1..n-6))
%o A049795 [a(n) for n in (4..60)] # _G. C. Greubel_, Dec 10 2019
%o A049795 (GAP)
%o A049795 a:= function(n)
%o A049795     if n<7 then return n-3;
%o A049795     else return Sum([1..n-6], j-> Int((n-3)/Int((n-6)/j)) );
%o A049795     fi; end;
%o A049795 List([4..60], n-> a(n) ); # _G. C. Greubel_, Dec 10 2019
%Y A049795 Cf. A049790, A049791, A049792, A049793, A049794, A049796.
%K A049795 nonn
%O A049795 4,2
%A A049795 _Clark Kimberling_