original_docstring: 
      Original Bk algorithm, returning boundries for mapping integers
      into constant sum blocks
      @param blocks is the number of blocks the map has
      @param maxi is the largest integer inside a block (0, ..., maxi)
      
docstring: Original Bk algorithm, returning boundries for mapping integers
  into constant sum blocks
  @param blocks is the number of blocks the map has
  @param maxi is the largest integer inside a block (0, ..., maxi)
docstring_tokens: Original Bk algorithm returning boundries for mapping integers into constant sum blocks @param blocks is the number of blocks the map has @param maxi is the largest integer inside a block ( 0 ... maxi )
code: def original_bk(k, blocks, maxi):
      """
      Original Bk algorithm, returning boundries for mapping integers
      into constant sum blocks
      @param blocks is the number of blocks the map has
      @param maxi is the largest integer inside a block (0, ..., maxi)
      """
      assert k >= 0
      if k is 0:
          return 0
      return original_bk(k - 1, blocks, maxi) + T_len(blocks - 1, k - 1)
code_tokens: def original_bk ( k , blocks , maxi ) : assert k >= 0 if k is 0 : return 0 return original_bk ( k - 1 , blocks , maxi ) + T_len ( blocks - 1 , k - 1 )
short_docstring: Original Bk algorithm, returning boundries for mapping integers
  into constant sum blocks
  @param blocks is the number of blocks the map has
  @param maxi is the largest integer inside a block (0, ..., maxi)
short_docstring_tokens: Original Bk algorithm returning boundries for mapping integers into constant sum blocks @param blocks is the number of blocks the map has @param maxi is the largest integer inside a block ( 0 ... maxi )
comment: """
      Original Bk algorithm, returning boundries for mapping integers
      into constant sum blocks
      @param blocks is the number of blocks the map has
      @param maxi is the largest integer inside a block (0, ..., maxi)
      """