Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A048163
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A048163 Sum_{k=1..n} ((k-1)!)^2*Stirling2(n,k)^2. +0
3
1, 2, 14, 230, 6902, 329462, 22934774, 2193664790, 276054834902, 44222780245622, 8787513806478134, 2121181056663291350, 611373265185174628502, 207391326125004608457782, 81791647413265571604175094, 37109390748309009878392597910 (list; graph; listen)
OFFSET

1,2

REFERENCES

K. Vesztergombi, Permutations with restriction of middle strength, Stud. Sci. Math. Hungar., 9 (1974), 181-185.

Lovasz, L. and Vesztergombi, K.; Restricted permutations and Stirling numbers. Combinatorics (Proc. Fifth Hungarian Colloq., Keszthely, 1976), Vol. II, pp. 731-738, Colloq. Math. Soc. Janos Bolyai, 18, North-Holland, Amsterdam-New York, 1978.

FORMULA

(-1)^(n-1) * Sum[k=0..n-1, (-1)^k*(k+1)^(n-1)*k!*Stirling2(k, n) ]. - Ralf Stephan, Oct 27 2004

CROSSREFS

Main diagonal of array A099594.

Adjacent sequences: A048160 A048161 A048162 this_sequence A048164 A048165 A048166

Sequence in context: A034405 A105749 A118086 this_sequence A093548 A052215 A053846

KEYWORD

nonn

AUTHOR

njas, R. K. Guy

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 October 13 20:18 EDT 2008. Contains 145016 sequences.


AT&T Labs Research