|
|
A242172
|
|
a(n) = 2^n*binomial((n + 1 + (n mod 2))/2, 1/2).
|
|
0
|
|
|
1, 3, 6, 15, 30, 70, 140, 315, 630, 1386, 2772, 6006, 12012, 25740, 51480, 109395, 218790, 461890, 923780, 1939938, 3879876, 8112468, 16224936, 33801950, 67603900, 140408100, 280816200, 581690700, 1163381400, 2404321560, 4808643120, 9917826435, 19835652870
(list;
graph;
refs;
listen;
history;
text;
internal format)
|
|
|
OFFSET
|
0,2
|
|
LINKS
|
|
|
FORMULA
|
a(2*n+2)/2 = a(2*n+1).
Conjecture: (n+1)*a(n) -2*a(n-1) +4*(-n-1)*a(n-2)=0. - R. J. Mathar, May 11 2014
Sum_{n>=0} 1/a(n) = 2*Pi/sqrt(3) - 2. - Amiram Eldar, Mar 04 2023
|
|
MAPLE
|
a := n -> 2^n*binomial((n+1+(n mod 2))/2, 1/2); seq(a(n), n=0..29);
|
|
MATHEMATICA
|
a[n_] := 2^n*Binomial[(n + 1 + Mod[n, 2])/2, 1/2]; Array[a, 33, 0] (* Amiram Eldar, Mar 04 2023 *)
|
|
CROSSREFS
|
|
|
KEYWORD
|
nonn
|
|
AUTHOR
|
|
|
STATUS
|
approved
|
|
|
|