Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A105219
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A105219 Let b(n) denote the squares, A000290: a(n) = Sum{k=0..n}C(n,k)^2*(n-k)!*b(k). +0
2
0, 1, 8, 63, 544, 5225, 55656, 653023, 8379008, 116780049, 1757211400, 28394129951, 490371506208, 9013522796473, 175679564492264, 3618800515187775, 78547755741723136, 1791704327280481313 (list; graph; listen)
OFFSET

0,3

COMMENT

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). (Thanks to Vladeta Jovovic for help.)

FORMULA

E.g.f. = (x/(1-x)^2+x^2/(1-x)^3)*exp(x/(1-x))

EXAMPLE

b(n) = 0,1,4,9,16,25,36,49,64,...

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*4+1*1*9 = 0+18+36+9 = 63

MAPLE

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

CROSSREFS

Cf. A000290.

Sequence in context: A081107 A164592 A001090 this_sequence A037205 A060071 A084096

Adjacent sequences: A105216 A105217 A105218 this_sequence A105220 A105221 A105222

KEYWORD

easy,nonn

AUTHOR

Miklos Kristof (kristmikl(AT)freemail.hu), Apr 13 2005

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 | Maintained by N. J. A. Sloane (njas@research.att.com)

Last modified December 17 19:39 EST 2009. Contains 170821 sequences.


AT&T Labs Research