def hilbert(n):
values = <NUM_LIT:1.0> / (<NUM_LIT:1.0> + np.arange(<NUM_LIT:2> * n - <NUM_LIT:1>))<EOL>h = hankel(values[:n], r=values[n - <NUM_LIT:1>:])<EOL>return h<EOL>
Create a Hilbert matrix of order `n`.

Returns the `n` by `n` array with entries `h[i,j] = 1 / (i + j + 1)`.

Parameters
----------
n : int
    The size of the array to create.

Returns
-------
h : (n, n) ndarray
    The Hilbert matrix.

See Also
--------
invhilbert : Compute the inverse of a Hilbert matrix.

Notes
-----
.. versionadded:: 0.10.0

Examples
--------
>>> from scipy.linalg import hilbert
>>> hilbert(3)
array([[ 1.        ,  0.5       ,  0.33333333],
       [ 0.5       ,  0.33333333,  0.25      ],
       [ 0.33333333,  0.25      ,  0.2       ]])