In 2018 Deza et al. proved the NP-completeness of deciding wether there exists a 3-uniform hypergraph compatible with a given degree sequence. A well known result of Erdös and Gallai (1960) shows that the same problem related to graphs can be solved in polynomial time. So, it becomes relevant to detect classes of uniform hypergraphs that are reconstructible in polynomial time. In particular, our study concerns 3-uniform hypergraphs that are defined in the NP-completeness proof of Deza et al. Those hypergraphs are constructed starting from a non-increasing sequence s of integers and have very interesting properties. In particular, they are unique, i.e., there do not exist two non isomorphic 3-uniform hypergraphs having the same degree sequence ds. This property makes us conjecture that the reconstruction of these hypergraphs from their degree sequences can be done in polynomial time. So, we first generalize the computation of the ds degree sequences by Deza et al., and we show their uniqueness. We proceed by defining the equivalence classes of the integer sequences determining the same ds and we define a (minimal) representative. Then, we find the asymptotic growth rate of the maximal element of the representatives in terms of the length of the sequence, with the aim of generating and then reconstructing them. Finally, we show an example of a unique 3-uniform hypergraph similar to those defined by Deza et al. that does not admit a generating integer sequence s. The existence of this hypergraph makes us conjecture an extended generating algorithm for the sequences of Deza et al. to include a much wider class of unique 3-uniform hypergraphs. Further studies could also include strategies for the identification and reconstruction of those new sequences and hypergraphs.