def compute_g(n):
 a = compute_a((2 * n))
 g = []
 for k in range(n):
  g.append(((mp.sqrt(2) * mp.rf(0.5, k)) * a[(2 * k)]))
 return g

def compute_g ( n ) : a = compute_a ( ( 2 * n ) ) g = [ ] for k in range ( n ) : g . append ( ( ( mp . sqrt ( 2 ) * mp . rf ( 0.5 , k ) ) * a [ ( 2 * k ) ] ) ) return g
g_k from dlmf 5 .