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

A010755
Sum along upward diagonal of Pascal triangle up to (but not including) halfway point.
3
0, 0, 1, 1, 1, 1, 6, 7, 8, 9, 38, 47, 57, 68, 245, 313, 393, 486, 1594, 2080, 2673, 3388, 10429, 13817, 18058, 23307, 68497, 91804, 121541, 159081, 451166, 610247, 816256, 1080399, 2978230, 4058629, 5474584, 7313138, 19694622, 27007760, 36687377
OFFSET
0,7
LINKS
FORMULA
a(n) = Sum_{k=0..floor((n-2)/4)} binomial(n - k, k). - Seiichi Manyama, Feb 10 2022
PROG
(PARI) a(n) = sum(k=0, (n-2)\4, binomial(n-k, k)); \\ Seiichi Manyama, Feb 10 2022
CROSSREFS
KEYWORD
nonn
AUTHOR
STATUS
approved