OFFSET
0,2
LINKS
Reinhard Zumkeller, Table of n, a(n) for n = 0..1000
FORMULA
a(n) = (2^(n-1) + 0^n/2)*C(2n+1, n).
Conjecture: (n+1)*a(n) +4*(-2*n-1)*a(n-1)=0. - R. J. Mathar, Oct 19 2014
From Reinhard Zumkeller, Jan 15 2015: (Start)
a(n) = A069720(n+1)/2. (End)
From Amiram Eldar, Jan 16 2024: (Start)
Sum_{n>=0} 1/a(n) = 64*arcsin(1/(2*sqrt(2)))/(7*sqrt(7)) + 1/7.
Sum_{n>=0} (-1)^n/a(n) = 32*log(2)/27 - 1/9. (End)
EXAMPLE
a(0)=(2^(-1)+(0^0)/2)C(1,0)=2*(1/2)=1 (use 0^0=1).
MATHEMATICA
Join[{1}, Table[2^(n-1)* Binomial[2*n+1, n], {n, 1, 30}]] (* G. C. Greubel, Feb 05 2018 *)
PROG
(Haskell)
a082143 0 = 1
a082143 n = (a000079 $ n - 1) * (a001700 n)
-- Reinhard Zumkeller, Jan 15 2015
(PARI) for(n=0, 30, print1((2^(n-1) + 0^n/2)*Binomial(2*n+1, n), ", ")) \\ G. C. Greubel, Feb 05 2018
(Magma) [(2^(n-1) + 0^n/2)*Binomial(2*n+1, n): n in [0..30]]; // G. C. Greubel, Feb 05 2018
CROSSREFS
KEYWORD
easy,nonn
AUTHOR
Paul Barry, Apr 06 2003
STATUS
approved