login
This site is supported by donations to The OEIS 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; internal format)
OFFSET

0,2

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: A019014 A128595 A180749 * A167007 A064006 A003095

Adjacent sequences:  A111192 A111193 A111194 * A111196 A111197 A111198

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

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Transforms | Puzzles | Hot | Classics
Recent Additions | More pages | Superseeker | Maintained by The OEIS Foundation Inc.

Content is available under The OEIS End-User License Agreement .

Last modified February 14 01:35 EST 2012. Contains 205567 sequences.