Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A091344
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A091344 a(n)=Sum(i!i^2 Stirling2(n,i)(-1)^(n-i),i=1,..,n) +0
2
0, 1, 7, 31, 115, 391, 1267, 3991, 12355, 37831, 115027, 348151, 1050595, 3164071, 9516787, 28599511, 85896835, 257887111, 774054547, 2322950071, 6970423075, 20914414951, 62749536307, 188261191831, 564808741315, 1694476555591 (list; graph; listen)
OFFSET

0,3

FORMULA

a(n) = 2*3^n-3*2^n+1. - Vladeta Jovovic (vladeta(AT)Eunet.yu), Jan 01 2004

MAPLE

a:=n->sum((3^(n-j-1)-2^(n-2-j))*12, j=0..n): seq(a(n), n=-1..24); - Zerinvary Lajos (zerinvarylajos(AT)yahoo.com), Feb 11 2007

with (combinat):a:=n->stirling2(n, 3)+stirling2(n+1, 3): seq(a(n), n=1..26); - Zerinvary Lajos (zerinvarylajos(AT)yahoo.com), Oct 07 2007

MATHEMATICA

Table[Sum[i!i^2 StirlingS2[n, i](-1)^(n - i), {i, 1, n}], {n, 0, 30}]

CROSSREFS

Sequence in context: A055580 A097786 A006458 this_sequence A032197 A114289 A048775

Adjacent sequences: A091341 A091342 A091343 this_sequence A091345 A091346 A091347

KEYWORD

easy,nonn

AUTHOR

Mario Catalani (mario.catalani(AT)unito.it), Jan 01 2004

page 1

Search completed in 0.003 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 August 19 23:53 EDT 2008. Contains 142930 sequences.


AT&T Labs Research