|
Search: id:A054108
|
|
|
| A054108 |
|
a(n)=(-1)^(n+1)*sum(k=0,n,(-1)^k*binomial(2*k,k)). |
|
+0
4
|
|
| 1, 5, 15, 55, 197, 727, 2705, 10165, 38455, 146301, 559131, 2145025, 8255575, 31861025, 123256495, 477823895, 1855782325, 7219352975, 28125910825, 109720617995, 428537256445, 1675561707275, 6557869020325, 25689734662775
(list; graph; listen)
|
|
|
OFFSET
|
0,2
|
|
|
COMMENT
|
p divides a((p-3)/2) for p=11,19,29,31,41,59,61,71..=A045468 Primes congruent to {1, 4} mod 5. - Alexander Adamchuk (alex(AT)kolmogorov.com), Jul 05 2006
The sequence 1,1,5,15,55,... has general term sum{k=0..n, (-1)^(n-k)*C(2k,k)}. Its Hankel transform is A082761. - Paul Barry (pbarry(AT)wit.ie), Apr 10 2007
|
|
FORMULA
|
Also: a(n)=C[2n, n]-a(n-1) with a(0)=1 - Labos E. (labos(AT)ana.hu), Apr 26 2003
C(2n,n) - C(2n-2,n-1) + ... +(-1)^(k+n)*C(2k,k)+ ... + (-1)^(1+n)*C(2,1) + (-1)^n*C(0,0), where C(2k,k)=(2k)!/(k!)^2 - central binomial coefficients A000984[k]. - Alexander Adamchuk (alex(AT)kolmogorov.com), Jul 05 2006
a(n) = Sum[(-1)^(k+n)*((2k)!/(k!)^2),{k,0,n}]. - Alexander Adamchuk (alex(AT)kolmogorov.com), Jul 05 2006
|
|
MATHEMATICA
|
Table[Sum[(-1)^(k+n)*((2k)!/(k!)^2), {k, 0, n}], {n, 1, 50}] - Alexander Adamchuk (alex(AT)kolmogorov.com), Jul 05 2006
|
|
PROGRAM
|
(PARI) a(n)=(-1)^(n+1)*sum(k=0, n, (-1)^k*binomial(2*k, k))
|
|
CROSSREFS
|
T(2n, n), array T as in A054106.
Cf. A066796, A000984, A054109, A006134, A045468.
Sequence in context: A007714 A123011 A006358 this_sequence A149585 A114947 A149586
Adjacent sequences: A054105 A054106 A054107 this_sequence A054109 A054110 A054111
|
|
KEYWORD
|
nonn
|
|
AUTHOR
|
Clark Kimberling (ck6(AT)evansville.edu)
|
|
EXTENSIONS
|
Formula from Benoit Cloitre (benoit7848c(AT)orange.fr), Sep 29 2002
|
|
|
Search completed in 0.002 seconds
|
