Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A111903
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A111903 The work performed by a partial function f:{1,...,n}->{1,...,n} is defined to be work(f)=sum(|i-f(i)|,i in dom(f)); a(n) is equal to sum(work(f)) where the sum is over all order-preserving partial functions f:{1,...,n}->{1,...,n}. +0
4
0, 4, 48, 424, 3312, 24204, 169632, 1155152, 7702944, 50550932, 327591504, 2101442808, 13367744784, 84438657820, 530179314240, 3311794268320, 20594613427776, 127564892050212, 787394746252656 (list; graph; listen)
OFFSET

1,2

LINKS

James East The Work Performed by a Transformation Semigroup, preprint 2005.

FORMULA

Sum(i, j=1...n;k, l=0...n, |i-j|*(i-1 choose k)*(j+k-1 choose k)*(n-i choose l)*(n-j+l choose l))

EXAMPLE

When n=2 there are 8 order-preserving partial maps {1,2}->{1,2}. these are (1 2), (1 1), (2 2), (1 -), (2 -), (- 1), (- 2) (- -). Adding up the work performed by these maps (from left to right as arranged above) gives a(2)=0+1+1+0+1+1+0+0=4.

CROSSREFS

Cf. A111867, A111873, A111874.

Sequence in context: A144704 A091904 A158681 this_sequence A059409 A026942 A159903

Adjacent sequences: A111900 A111901 A111902 this_sequence A111904 A111905 A111906

KEYWORD

easy,nonn

AUTHOR

James East (jameseastseq(AT)hotmail.com), Nov 23 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 November 25 20:09 EST 2009. Contains 167514 sequences.


AT&T Labs Research