|
|
A175167
|
|
a(n) = Sum_{j=1..floor(n/2)} binomial(n+j-1,j-1).
|
|
1
|
|
|
0, 1, 1, 6, 7, 36, 45, 220, 286, 1365, 1820, 8568, 11628, 54264, 74613, 346104, 480700, 2220075, 3108105, 14307150, 20160075, 92561040, 131128140, 600805296, 854992152, 3910797436, 5586853480, 25518731280, 36576848168, 166871334960
(list;
graph;
refs;
listen;
history;
text;
internal format)
|
|
|
OFFSET
|
1,4
|
|
COMMENTS
|
As n -> infinity, a(2n)/a(2n-1) -> 9/2 and a(2n+1)/a(2n) -> 3/2.
|
|
LINKS
|
|
|
FORMULA
|
a(n)=Sum(Binomial(n+j-1,j-1),(j,1,Floor[n/2])).
a(n) = floor(n/2) * C(n+floor(n/2), floor(n/2)) / (n+1). - Vaclav Kotesovec, Mar 02 2014
From Robert Israel, Feb 15 2019: (Start)(2*n+4)*a(n+1) = (3*n+2)*a(n) if n is even.
2*(n+2)*(n-1)*a(n+1) = 3*(n+1)*(3*n+1)*a(n) if n is odd. (End)
|
|
MAPLE
|
f:= proc(n) option remember;
if n::odd then (3*n-1)/(2*n+2)*procname(n-1)
else 3*n*(3*n-2)*procname(n-1)/(2*(n+1)*(n-2)) fi
end proc:
f(1):= 0: f(2):= 1: f(3):= 1:
|
|
MATHEMATICA
|
f[n_] := Sum[ Binomial[n + j - 1, j - 1], {j, n/2}]; Array[f, 30]
|
|
CROSSREFS
|
|
|
KEYWORD
|
nonn
|
|
AUTHOR
|
|
|
STATUS
|
approved
|
|
|
|