login

Year-end appeal: Please make a donation to the OEIS Foundation to support ongoing development and maintenance of the OEIS. We are now in our 61st year, we have over 378,000 sequences, and we’ve reached 11,000 citations (which often say “discovered thanks to the OEIS”).

A049797
a(n) = Sum_{k = 2..n} T(n,k), array T as in A049800.
3
0, 0, 0, 2, 0, 4, 4, 4, 6, 14, 4, 14, 20, 16, 16, 30, 22, 38, 32, 30, 44, 64, 38, 50, 68, 68, 66, 92, 66, 94, 94, 96, 122, 130, 90, 124, 154, 158, 136, 174, 148, 188, 194, 172, 210, 254, 196, 228, 240, 248, 258, 308, 282, 302, 284
OFFSET
1,4
LINKS
MAPLE
seq(add((n+1) mod floor((k+1)/2), k = 3..n), n = 1..60);
MATHEMATICA
Table[Sum[Mod[n+1, Floor[(k+1)/2]], {k, 3, n}], {n, 60}] (* G. C. Greubel, Dec 09 2019 *)
PROG
(PARI) vector(60, n, sum(k=3, n, (n+1)%((k+1)\2)) ) \\ G. C. Greubel, Dec 09 2019
(Magma) [0, 0] cat [ (&+[(n+1) mod Floor((k+1)/2): k in [3..n]]): n in [3..60]]; // G. C. Greubel, Dec 09 2019
(Sage) [sum( (n+1)%floor((k+1)/2) for k in (3..n)) for n in (1..60)] # G. C. Greubel, Dec 09 2019
(GAP) List([1..60], n-> Sum([3..n], k-> (n+1) mod Int((k+1)/2)) ); # G. C. Greubel, Dec 09 2019
CROSSREFS
Cf. A049800.
Sequence in context: A300328 A365382 A200291 * A116578 A078050 A134271
KEYWORD
nonn
STATUS
approved