Results 1 
2 of
2
Numerically satisfactory solutions of hypergeometric recursions
 Math. Comp
"... Abstract. Each family of Gauss hypergeometric functions fn = 2F1(a + ε1n, b + ε2n; c + ε3n; z), n ∈ Z, for fixed εj =0,±1 (notallεjequal to zero) satisfies a second order linear difference equation of the form Anfn−1 + Bnfn + Cnfn+1 =0. Because of symmetry relations and functional relations for the ..."
Abstract

Cited by 8 (3 self)
 Add to MetaCart
Abstract. Each family of Gauss hypergeometric functions fn = 2F1(a + ε1n, b + ε2n; c + ε3n; z), n ∈ Z, for fixed εj =0,±1 (notallεjequal to zero) satisfies a second order linear difference equation of the form Anfn−1 + Bnfn + Cnfn+1 =0. Because of symmetry relations and functional relations
The ABC of hyper recursions
 J. Comput. Appl. Math
"... Dedicated to Roderick Wong on occasion of his 60 th birthday. Each family of Gauss hypergeometric functions fn = 2F1(a + ε1n, b + ε2n; c + ε3n; z), for fixed εj = 0, ±1 (not all εj equal to zero) satisfies a second order linear difference equation of the form Anfn−1 + Bnfn + Cnfn+1 = 0. Because of s ..."
Abstract

Cited by 8 (4 self)
 Add to MetaCart
Dedicated to Roderick Wong on occasion of his 60 th birthday. Each family of Gauss hypergeometric functions fn = 2F1(a + ε1n, b + ε2n; c + ε3n; z), for fixed εj = 0, ±1 (not all εj equal to zero) satisfies a second order linear difference equation of the form Anfn−1 + Bnfn + Cnfn+1 = 0. Because