Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A024419
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A024419 a(n) = n!(1/C(n,0) + 1/C(n,1) + ... + 1/C(n,[ n/2 ])). +0
3
1, 1, 3, 8, 34, 156, 924, 6144, 48096, 420480, 4134240, 44720640, 530444160, 6824805120, 94787884800, 1412038656000, 22464536371200, 380017225728000, 6811416338227200, 128936055177216000, 2570286167543808000 (list; graph; listen)
OFFSET

0,3

FORMULA

G.f.: (G(x)^2+H(x))/2 where G(x) = Sum_{k>=0} k!*x^k and G(x) = Sum_{k>=0} k!^2*x^(2*k). - Vladeta Jovovic (vladeta(AT)eunet.rs), Sep 22 2007

EXAMPLE

a(3)=3!*(1/1 + 1/3)=6*4/3=8

MAPLE

a:=proc(n) options operator, arrow: factorial(n)*(sum(1/binomial(n, k), k= 0.. floor((1/2)*n))) end proc: seq(a(n), n=0..21); - Emeric Deutsch (deutsch(AT)duke.poly.edu), Oct 11 2007

CROSSREFS

Sequence in context: A109655 A001120 A117722 this_sequence A094448 A063805 A125046

Adjacent sequences: A024416 A024417 A024418 this_sequence A024420 A024421 A024422

KEYWORD

nonn,easy

AUTHOR

Clark Kimberling (ck6(AT)evansville.edu)

EXTENSIONS

More terms from Emeric Deutsch (deutsch(AT)duke.poly.edu), Oct 11 2007

page 1

Search completed in 0.002 seconds

Lookup | Welcome | Find friends | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Transforms | Puzzles | Hot | Classics
More pages | Superseeker | The OEIS Foundation | Maintained by N. J. A. Sloane (njas@research.att.com)

Last modified March 20 01:21 EDT 2010. Contains 173643 sequences.


AT&T Labs Research