class_docstr: The Prufer correspondence is an algorithm that describes the
  bijection between labeled trees and the Prufer code. A Prufer
  code of a labeled tree is unique up to isomorphism and has
  a length of n - 2.
  
  Prufer sequences were first used by Heinz Prufer to give a
  proof of Cayley's formula.
  
  References
  ==========
  
  .. [1] https://mathworld.wolfram.com/LabeledTree.html
class_docstr_tok: ["The","Prufer","correspondence","is","an","algorithm","that","describes","the","bijection","between","labeled","trees","and","the","Prufer","code",".","A","Prufer","code","of","a","labeled","tree","is","unique","up","to","isomorphism","and","has","a","length","of","n","-","2",".","Prufer","sequences","were","first","used","by","Heinz","Prufer","to","give","a","proof","of","Cayley","'s","formula",".","References","==========","..","[","1","]","https",":","\/\/mathworld.wolfram.com\/LabeledTree.html"]
docstr: Returns Prufer sequence for the Prufer object.
  
  This sequence is found by removing the highest numbered vertex,
  recording the node it was attached to, and continuing until only
  two vertices remain. The Prufer sequence is the list of recorded nodes.
  
  Examples
  ========
  
  >>> from sympy.combinatorics.prufer import Prufer
  >>> Prufer([[0, 3], [1, 3], [2, 3], [3, 4], [4, 5]]).prufer_repr
  [3, 3, 3, 4]
  >>> Prufer([1, 0, 0]).prufer_repr
  [1, 0, 0]
  
  See Also
  ========
  
  to_prufer
docstr_tok: ["Returns","Prufer","sequence","for","the","Prufer","object",".","This","sequence","is","found","by","removing","the","highest","numbered","vertex",",","recording","the","node","it","was","attached","to",",","and","continuing","until","only","two","vertices","remain",".","The","Prufer","sequence","is","the","list","of","recorded","nodes",".","Examples","========",">",">",">","from","sympy.combinatorics.prufer","import","Prufer",">",">",">","Prufer","(","[","[","0",",","3","]",",","[","1",",","3","]",",","[","2",",","3","]",",","[","3",",","4","]",",","[","4",",","5","]","]",")",".prufer_repr","[","3",",","3",",","3",",","4","]",">",">",">","Prufer","(","[","1",",","0",",","0","]",")",".prufer_repr","[","1",",","0",",","0","]","See","Also","========","to_prufer"]
code: def prufer_repr(self):
      """Returns Prufer sequence for the Prufer object.
  
      This sequence is found by removing the highest numbered vertex,
      recording the node it was attached to, and continuing until only
      two vertices remain. The Prufer sequence is the list of recorded nodes.
  
      Examples
      ========
  
      >>> from sympy.combinatorics.prufer import Prufer
      >>> Prufer([[0, 3], [1, 3], [2, 3], [3, 4], [4, 5]]).prufer_repr
      [3, 3, 3, 4]
      >>> Prufer([1, 0, 0]).prufer_repr
      [1, 0, 0]
  
      See Also
      ========
  
      to_prufer
  
      """
      if self._prufer_repr is None:
          self._prufer_repr = self.to_prufer(
              self._tree_repr[:], self.nodes
          )
      return self._prufer_repr
  
imports: from sympy.core import Basic
  from sympy.core.containers import Tuple
  from sympy.tensor.array import Array
  from sympy.core.sympify import _sympify
  from sympy.utilities.iterables import flatten, iterable
  from sympy.utilities.misc import as_int
  from collections import defaultdict
label_desc: Use image node_id 1 for calling the Prufer obj's underlying member method code with example usage: obj.prufer_repr() and returns: self