A010758 - OEIS

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

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”).

Other ways to Give

A010758

Sum along upward diagonal of Pascal triangle from (but not including) halfway point.

0, 0, 1, 2, 1, 3, 7, 14, 11, 25, 51, 97, 92, 189, 365, 674, 709, 1383, 2587, 4685, 5270, 9955, 18228, 32551, 38403, 70954, 127921, 226007, 276408, 502415, 895103, 1568062, 1972851, 3540913, 6249235, 10871723, 13996408, 24868131, 43551364, 75326395, 98847749

(list; graph; refs; listen; history; text; internal format)

OFFSET

0,4

LINKS

Seiichi Manyama, Table of n, a(n) for n = 0..1000

FORMULA

a(n) = Sum_{k = 1 + floor(n/4)..floor(n/2)} binomial(n - k, k). - Sean A. Irvine, Jun 09 2018

PROG

(PARI) a(n) = sum(k=n\4+1, n\2, binomial(n-k, k)); \\ Seiichi Manyama, Feb 10 2022

CROSSREFS

Cf. A000045, A007318, A010754, A010755, A010759.

Sequence in context: A063509 A137766 A294620 * A259419 A019224 A298096

Adjacent sequences: A010755 A010756 A010757 * A010759 A010760 A010761

KEYWORD

nonn

AUTHOR

R. K. Guy

STATUS

approved