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

 

Logo
Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A010758 Sum along upward diagonal of Pascal triangle from (but not including) halfway point. 3
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
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
Sequence in context: A063509 A137766 A294620 * A259419 A019224 A298096
KEYWORD
nonn
AUTHOR
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.

License Agreements, Terms of Use, Privacy Policy. .

Last modified March 18 22:56 EDT 2024. Contains 370952 sequences. (Running on oeis4.)