|
Search: id:A111196
|
|
|
| A111196 |
|
a(n) = 2^(-n)*Sum_{k, k=0..n} binomial(2*n+1,2*k+1)*A000364(n-k). |
|
+0
1
|
|
| 1, 2, 9, 78, 1141, 25442, 804309, 34227438, 1886573641, 130746521282, 11127809595009, 1141012634368398, 138730500808639741, 19735099323279743522, 3247323803322747092109, 611982206046097666022958
(list; graph; listen)
|
|
|
OFFSET
|
0,2
|
|
|
FORMULA
|
a(n) = 2^(-n)*A002084(n).
|
|
MATHEMATICA
|
t = Range[0, 32]!CoefficientList[ Series[ Sec[x], {x, 0, 32}], x]; f[n_] := 2^(-n)*Sum [Binomial[2n + 1, 2k + 1]*t[[2n - 2k + 1]], {k, 0, n}]; Table[ f[n], {n, 0, 16}] (* Robert G. Wilson v *)
|
|
CROSSREFS
|
Cf. A103327, A000001.
Adjacent sequences: A111193 A111194 A111195 this_sequence A111197 A111198 A111199
Sequence in context: A006059 A006041 A121131 this_sequence A056918 A122720 A109519
|
|
KEYWORD
|
easy,nonn
|
|
AUTHOR
|
Philippe DELEHAM (kolotoko(AT)wanadoo.fr), Oct 24 2005
|
|
EXTENSIONS
|
More terms from Robert G. Wilson v (rgwv(at)rgwv.com), Oct 24 2005
|
|
|
Search completed in 0.002 seconds
|
