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

Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A105277 Let b(n) denote the Fibonacci numbers, A000045: a(n) = Sum{k=0..n}C(n,k)^2*(n-k)!*b(k). 1
0, 1, 5, 29, 203, 1680, 16058, 173865, 2099957, 27952999, 406125305, 6389713034, 108157272720, 1958821525361, 37779732341077, 772829270394685, 16708083353842267, 380563529091632760, 9106983116342966818 (list; graph; refs; listen; history; internal format)
OFFSET

0,3

COMMENTS

If E.g.f. of b(n) is E(x) and a(n) = Sum{k=0..n}C(n,k)^2*(n-k)!*b(k), then E.g.f. of a(n) is E(x/(1-x))/(1-x).

FORMULA

E.g.f.: (2/sqrt(5))*exp(x/2/(1-x))*sinh(sqrt(5)*x/2/(1-x))/(1-x).

EXAMPLE

b(n) = 0,1,1,2,3,5,8,13,21,34,55,...

a(3) = C(3,0)^2*3!*b(0)+C(3,1)^2*2!*b(1)+C(3,2)^2*1!*b(2)+C(3,3)^2*0!*b(3) = 1*6*0+9*2*1+9*1*1+1*1*2 = 0+18+9+2 = 29

MAPLE

b[0]:=0:b[1]:=1:for n from 2 to 30 do b[n]:=b[n-1]+b[n-2] od: seq(sum('binomial(n, k)^2*(n-k)!*b[k]', 'k'=0..n), n=0..30);

CROSSREFS

Cf. A000045.

Sequence in context: A108453 A201203 A004213 * A103213 A057588 A030522

Adjacent sequences:  A105274 A105275 A105276 * A105278 A105279 A105280

KEYWORD

easy,nonn

AUTHOR

Miklos Kristof (kristmikl(AT)freemail.hu), Apr 25 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 17 06:27 EST 2012. Contains 205998 sequences.