login
The OEIS Foundation is supported by donations from users of the OEIS and by a grant from the Simons Foundation.

 

Logo


Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A049796 a(n) = T(n,n-4), array T as in A049790. 7
1, 2, 3, 4, 5, 9, 16, 22, 32, 39, 53, 64, 79, 91, 113, 124, 147, 166, 188, 208, 238, 256, 288, 313, 344, 371, 411, 434, 473, 509, 548, 580, 629, 657, 709, 749, 796, 837, 893, 928, 987, 1038, 1093, 1136, 1206, 1246, 1314, 1371, 1431 (list; graph; refs; listen; history; text; internal format)
OFFSET

5,2

LINKS

G. C. Greubel, Table of n, a(n) for n = 5..1000

MAPLE

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

MATHEMATICA

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 *)

PROG

(PARI) a(n) = if(n<9, n-4, sum(j=1, n-8, (n-4)\((n-8)\j)) );

vector(60, n, a(n+4) ) \\ G. C. Greubel, Dec 10 2019

(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

(Sage)

def a(n):

    if (n<9): return n-4

    else: return sum(floor((n-4)/floor((n-8)/j)) for j in (1..n-8))

[a(n) for n in (5..60)] # G. C. Greubel, Dec 10 2019

(GAP)

a:= function(n)

    if n<9 then return n-4;

    else return Sum([1..n-8], j-> Int((n-4)/Int((n-8)/j)) );

    fi; end;

List([5..60], n-> a(n) ); # G. C. Greubel, Dec 10 2019

CROSSREFS

Cf. A049790, A049791, A049792, A049793, A049794, A049795.

Sequence in context: A107799 A329049 A003271 * A106165 A305237 A088817

Adjacent sequences:  A049793 A049794 A049795 * A049797 A049798 A049799

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 | Recent
The OEIS Community | Maintained by The OEIS Foundation Inc.

License Agreements, Terms of Use, Privacy Policy. .

Last modified July 8 05:33 EDT 2020. Contains 335513 sequences. (Running on oeis4.)