Triangle read by rows: T(n,k) is the number of functions f:{1,2,...,n}->{1,2,...,n} that have exactly k nonrecurrent elements mapped to some (one or more) recurrent element. n >= 1, 0 <= k <= n-1.

A216971

Triangle read by rows: T(n,k) is the number of functions f:{1,2,...,n}->{1,2,...,n} that have exactly k nonrecurrent elements mapped to some (one or more) recurrent element. n >= 1, 0 <= k <= n-1.

Terms

    a(0) =1a(1) =2a(2) =2a(3) =6a(4) =18a(5) =3a(6) =24a(7) =156a(8) =72a(9) =4a(10) =120a(11) =1520a(12) =1260a(13) =220a(14) =5a(15) =720a(16) =17310a(17) =21000a(18) =7020a(19) =600a(20) =6a(21) =5040a(22) =232932a(23) =363720a(24) =187320a(25) =32970a(26) =1554a(27) =7a(28) =40320a(29) =3698744

External references