The OEIS is supported by the many generous donors to the OEIS Foundation.

 Hints (Greetings from The On-Line Encyclopedia of Integer Sequences!)
 A049793 a(n) = T(n,n-1), array T as in A049790. 7
 1, 2, 4, 9, 13, 22, 27, 39, 47, 61, 71, 91, 100, 122, 137, 160, 175, 205, 220, 253, 272, 304, 326, 368, 386, 427, 455, 497, 523, 575, 598, 651, 683, 733, 768, 830, 856, 918, 959, 1021, 1056, 1129, 1162, 1236, 1281, 1347, 1393 (list; graph; refs; listen; history; text; internal format)
 OFFSET 2,2 LINKS G. C. Greubel, Table of n, a(n) for n = 2..1000 MAPLE seq( `if`(n=2, 1, add(floor((n-1)/floor((n-2)/j)), j=1..n-2)), n=2..60); # G. C. Greubel, Dec 10 2019 MATHEMATICA Table[If[n==2, 1, Sum[Floor[(n-1)/Floor[(n-2)/j]], {j, n-2}]], {n, 2, 60}] (* G. C. Greubel, Dec 10 2019 *) PROG (PARI) a(n) = if(n==2, 1, sum(j=1, n-2, (n-1)\((n-2)\j)) ); vector(60, n, a(n+1) ) \\ G. C. Greubel, Dec 10 2019 (Magma) [n eq 2 select 1 else (&+[Floor((n-1)/Floor((n-2)/j)): j in [1..n-2]]): n in [2..60]]; // G. C. Greubel, Dec 10 2019 (Sage) def a(n): if (n==2): return 1 else: return sum(floor((n-1)/floor((n-2)/j)) for j in (1..n-2)) [a(n) for n in (2..60)] # G. C. Greubel, Dec 10 2019 (GAP) a:= function(n) if n=2 then return 1; else return Sum([1..n-2], j-> Int((n-1)/Int((n-2)/j)) ); fi; end; List([2..60], n-> a(n) ); # G. C. Greubel, Dec 10 2019 CROSSREFS Cf. A049790, A049791, A049792, A049794, A049795, A049796. Sequence in context: A162761 A357355 A114885 * A090942 A328656 A085901 Adjacent sequences: A049790 A049791 A049792 * A049794 A049795 A049796 KEYWORD nonn AUTHOR Clark Kimberling STATUS approved

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Style Sheet | Transforms | Superseeker | Recents
The OEIS Community | Maintained by The OEIS Foundation Inc.

Last modified June 19 17:03 EDT 2024. Contains 373504 sequences. (Running on oeis4.)