login
The OEIS Foundation is supported by donations from users of the OEIS and by a grant from the Simons Foundation.

 

Logo


Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A111195 a(n) = 2^(-n)*Sum_{k=0..n} binomial(2*n+1,2*k+1)*A000364(k). 0
1, 2, 5, 26, 269, 4666, 121017, 4370722, 209364537, 12833657010, 979336390669, 91018760056938, 10120101446389765, 1326280083965014634, 202311875122389093761, 35535622109342844729074 (list; graph; refs; listen; history; text; internal format)
OFFSET

0,2

LINKS

Table of n, a(n) for n=0..15.

MATHEMATICA

t = Range[0, 34]!CoefficientList[ Series[ Sec[x], {x, 0, 34}], x]; f[n_] := 2^(-n)*Sum [Binomial[2n + 1, 2k + 1]*t[[2k + 1]], {k, 0, n}]; Table[ f[n], {n, 0, 17}] (* Robert G. Wilson v *)

CROSSREFS

Cf. A103327, A000002.

Sequence in context: A128595 A180749 A323299 * A323293 A258868 A322705

Adjacent sequences:  A111192 A111193 A111194 * A111196 A111197 A111198

KEYWORD

easy,nonn

AUTHOR

Philippe Deléham, Oct 24 2005

EXTENSIONS

More terms from Robert G. Wilson v, Oct 24 2005

STATUS

approved

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Style Sheet | Transforms | Superseeker | Recent
The OEIS Community | Maintained by The OEIS Foundation Inc.

License Agreements, Terms of Use, Privacy Policy. .

Last modified June 4 04:39 EDT 2020. Contains 334815 sequences. (Running on oeis4.)