Abbreviation: PSgrp
A \emph{partial semigroup} is a structure A=⟨A,⋅⟩, where
⋅ is a \emph{partial binary operation}, i.e., ⋅:A×A→A+{∗} and
⋅ is \emph{associative}: (x⋅y)⋅z≠∗ or x⋅(y⋅z)≠∗ imply (x⋅y)⋅z=x⋅(y⋅z).
Let A and B be partial groupoids. A morphism from A to B is a function h:A→B that is a homomorphism: if x⋅y≠∗ then h(x⋅y)=h(x)⋅h(y)
Example 1: The morphisms is a small category under composition.
Partial semigroups can be identified with semigroups with zero since for any partial semigroup A we can define a semigroup A0=A∪{0} (assuming 0∉A) and extend the operation on A to A0 by 0x=0=x0 for all x∈A. Conversely, given a semigroup with zero, say B, define a partial semigroup A=B∖{0} and for x,y∈A let xy=∗ if xy=0 in B. These two maps are inverses of each other.
However, the category of partial semigroups is not the same as the category of semigroups with zero since the morphisms differ.
http://mathv.chapman.edu/~jipsen/uajs/PSgrp.html
$\begin{array}{lr}
f(1)= &2\\ f(2)= &12\\ f(3)= &90\\ f(4)= &960\\ f(5)= &\\
\end{array}\begin{array}{lr}
f(6)= &\\ f(7)= &\\ f(8)= &\\ f(9)= &\\ f(10)= &\\
\end{array}$