login
This site is supported by donations to The OEIS Foundation.
Logo

Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A081126 Binomial transform of n!/floor(n/2)!. 1
1, 2, 5, 16, 53, 206, 817, 3620, 16361, 80218, 401501, 2139512, 11641885, 66599846, 388962953, 2367284236, 14700573137, 94523836850, 619674301621, 4186249123808, 28809504493061, 203556335785342, 1463877667140065 (list; graph; refs; listen; history; internal format)
OFFSET

0,2

COMMENTS

Row sums of exponential Riordan array [(1+x),x(1+x)]. - Paul Barry (pbarry(AT)wit.ie), Apr 17 2007

LINKS

Guo-Niu Han, Enumeration of Standard Puzzles

FORMULA

a(n) =Sum {k=0..n, C(n, k)*n!/floor(n/2)!}

a(n) = A018191(n+1).

E.g.f.: (1+x)*exp(x+x^2). - Vladeta Jovovic (vladeta(AT)eunet.rs), Aug 06 2006

a(n)=Sum{k=0..n, C(n,k)*k!/floor(k/2)!}; a(n)=sum{k=0..n, C(k+1,n-k)*n!/k!}. - Paul Barry (pbarry(AT)wit.ie), Apr 17 2007

CROSSREFS

Cf. A018191, A081125.

Sequence in context: A148397 A148398 A100442 * A018191 A006191 A149959

Adjacent sequences:  A081123 A081124 A081125 * A081127 A081128 A081129

KEYWORD

easy,nonn

AUTHOR

Paul Barry (pbarry(AT)wit.ie), Mar 07 2003, Apr 17 2007

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 21:59 EST 2012. Contains 205667 sequences.