Preprint
Article

This version is not peer-reviewed.

Relations Established Between Hypergeometric Functions and Some Special Number Sequences

Submitted:

09 December 2025

Posted:

18 December 2025

You are already at the latest version

Abstract
In this study, we establish novel hypergeometric representations for the two classical sequences that are the Pell and Jacobsthal sequences. Building on Dilcher’s hypergeometric formulation of the Fibonacci sequence, we extend similar results and derive analogous structures for these two classical sequences. The results unify several known identities, provide new explicit representations, and offer a broader perspective on hypergeometric interpretations of linear second order recurrence sequences.
Keywords: 
;  ;  ;  

1. Introduction

Hypergeometric functions, with their serial definitions, parametric structures, and transformation properties, hold a central position in many branches of mathematics [1]. This field, pioneered by Gauss and Kummer, encompasses general solution approaches beyond classical methods and is now considered a powerful analytical tool not only in theoretical mathematics but also in many scientific fields, such as physics, biology, economics, numerical analysis, and cryptography [2,4,7,8].
The analytical power of hypergeometric functions is not limited to their respective differential equations; but also manifests in the relationships that can be established with various special number sequences. In this context, particular attention has been focused on the Fibonacci sequence, which enables the derivation of various hypergeometric representations [3]. This seemingly unnatural relationship has been made compatible with hypergeometric structures through parametric transformations and mappings. However, the applicability of a similar approach to structurally similar Pell and Jacobsthal sequences has been largely ignored in the literature.
In existing studies, representations of hypergeometric series have mostly been presented that are limited to only certain parameter values, and a significant part of these representations remains specific to the Fibonacci sequence.
However, Pell sequences also have similar second-order linear homogeneous recurrence relations and can be evaluated using the same theoretical framework. The Jacobsthal sequence can be analyzed analytically through its connection with Chebyshev polynomials in [9]. Roy studied binomial identities and hypergeometric series in [10].
This paper demonstrates that hypergeometric functions are not only special functions but also powerful tools for the analytical representation of sequences of integers. Pell and Jacobsthal sequences are reconstructed from a hypergeometric perspective using classical transformations, series expansions, integral representations, and connections to special polynomials.
Studies on the Fibonacci sequence are particularly prominent. Dilcher’s work details how hypergeometric functions can represent the Fibonacci sequence under different transformations and offers various representations using transformation techniques of classical series.
This article focuses on the re-expression of Pell and Jacobsthal sequences in terms of hypergeometric functions. We use Binet formulas and recurrence relations to illustrate their relationship with hypergeometric series.

2. Materials and Methods

The gamma function, which is included in the definition of many special functions, is given as
Γ ( x ) = 0 e t t x 1 d t , x > 0
with the following properties
Γ ( x ) = ( x 1 ) ! , x N
Γ ( x + 1 ) = x Γ ( x ) , x > 0
Γ ( x ) Γ ( 1 x ) = π s i n π x
Γ ( x ) Γ ( x + 1 2 ) = 2 1 2 x π Γ ( 2 x )
Given a is a constant real or complex number and n is a natural number, the Pochhammer symbol   ( a ) n is defined as
( a ) n = a ( a + 1 ) ( a + 2 ) ( a + n 1 )   ( 2.3 )
The Pochhammer symbol is named after the 19th-century German mathematician, Leo August Pochhammer. Although originally introduced in the context of differential equations, it is now used as a fundamental tool in numerous theoretical and applied studies involving hypergeometric functions, orthogonal polynomials, special number sequences and series solutions. We have
( a ) 0 = and ( 1 ) n = n !
( a ) n = Γ ( a + n ) Γ ( a )  
( a ) n + 1 = a ( a + 1 ) n  
( a ) n k = ( a ) n ( a + n k ) k
Jacobsthal numbers J n are a special sequence of integers defined recursively J 0 = 0 ,   J 1 = 1 ,   J n = J n 1 + 2 J n 2 ,   ( n 2 ) . The Binet formula of the Jacobsthal sequence is J n = 2 n ( 1 ) n 3   [ 5 ] .
Pell numbers P n are a special sequence of integers defined recursively P 0 = 0 ,   P 1 = 1 ,   P n = 2 P n 1 + P n 2 ,   ( n 2 ) . Pell sequence is given as P n = 1 2 2 ( ( 1 + 2 ) n ( 1 2 ) n )   [ 6 ] . Hypergeometric differential equation is defined as
x ( 1 x ) y + [ c ( a + b + 1 ) x ] y ' a b y = 0
Solutions of the hypergeometric differential equation at x=0 regular singular point are called hypergeometric functions:
y = A F ( a , b , c ; x ) + B x 1 c F ( a c + 1 , b c + 1,2 c ; x )
where A and B arbitrary constants. The general solution is valid for | x | < 1 .
The representation of the hypergeometric function is:
F ( a , b , c ; x ) = n = 0 ( a ) n ( b ) n ( c ) n n ! x n .
Some functions can be expressed by hypergeometric function in the following:
F ( 1,1 , 1 ; x ) = 1 1 x ,
F ( 1,2 , 1 ; x ) = 1 ( 1 x ) 2 ,
F ( n , 1 ; 1 ; 1 x ) = x n ,   n = 0,1 , 2 ,
F ( n , b , b ; x ) = ( 1 + x ) n ,
F ( 1,1 , 2 ; x ) = ln ( 1 + x ) x ,
e x = lim b F ( 1 , b , 1 ; x b ) .
Lemma 2.1 [1] Hypergeometric function holds the following property
F ( a , 1 2 + a , 3 2 ; z 2 ) = 1 2 z ( 1 2 a ) [ ( 1 + z ) 1 2 a ( 1 z ) 1 2 a ] ( 2.7 )
Lemma 2.2 [1] Hypergeometric function satisfies the following property
F ( a , b , c ; z ) = ( 1 z ) a F ( a , c b , c ; z z 1 ) . ( 2.8 )
Lemma 2.3 [1] Hypergeometric function satisfies the following property
F ( a , b , c ; z ) = ( 1 z ) b F ( b , c a , c ; z z 1 ) . ( 2.9 )
Lemma 2.4 [3] Hypergeometric function satisfies the following property
F ( a , b , c ; z ) = ( 1 z ) c a b F ( c a , c b , c ; z ) . ( 2.10 )
Lemma 2.5 Hypergeometric function satisfies the following property
F ( a , b , c ; z ) = ( 1 z ) a Γ ( c ) Γ ( b a ) Γ ( c a ) Γ ( b ) F ( a , c b , a b + 1 ; 1 1 z )
+ ( 1 z ) b Γ ( c ) Γ ( a b ) Γ ( a ) Γ ( c b ) F ( b , c a , b a + 1 ; 1 1 z ) ( 2.11 )

3. Main Results

This section comprehensively covers the analytic relationships between hypergeometric functions and some special integer sequences. The connection between the Fibonacci sequence and hypergeometric series is based on Dilcher’s work. In this context, the theoretical construction of serial representations using generating functions and recurrence relations for sequences is presented.
Theorem 3.1 The Jacobstral sequence is expressed by hypergeometric function as
J n = 2 n 1 2 i n 1 n F ( 1 n ,   1 + n ,   3 2 ;   2 2 i 1 4 2 i )
Proof: By [9] and by the representation of the second type of the Chebyshev polynomial with hypergeometric function, the Jacobstral sequence is expressed by Chebyshev polynomials as
J n = ( 2 i 2 ) n 1 2 U n 1 ( 1 2 2 i ) .   ( 3.1 )
If we substitute n = n - 1   and   x = 1 2 2 i in (3.1), we get
U n 1 ( 1 2 2 i ) = ( n 1 + 1 ) F ( ( n 1 ) ,   n 1 + 2 ,   3 2 ; 1 1 2 2 i 2 )
= n F ( 1 n ,   1 + n ,   3 2 ;   2 2 i 1 4 2 i )   ( 3.2 )
By (3.1) and (3.2), the result is obtained.
Theorem 3.2 The Pell sequence is expressed by hypergeometric function as
P n = n F ( 1 n 2 ,   1 n 2 ,   3 2 ;   2 ) .
Proof: The Binet formula of the Pell sequence is P n = ( 1 + 2 ) n ( 1 2 ) n 2 2 . If we substitute 1 2 a = n , a = 1 n 2 v e z = 2 in (2.7), we get
F ( 1 n 2 , 1 n 2 , 3 2 ; 2 ) = 1 2 2 n [ ( 1 + 2 ) n ( 1 2 2 ) n ] .
Theorem 3.3 The nth element of the Jacobstral sequence is expressed by hypergeometric function as
J n = 2 n 1 2 i n 1 k = 0 n 1 ( i 2 2 ) k ( n + k 2 k + 1 )
Proof: By Theorem (3.1) and the representation of the second type of the Chebyshev polynomial with hypergeometric function and the expansion of the series of the hypergeometric function, we have
J n = 2 n 1 2 i n 1 n F ( 1 n ,   1 + n ,   3 2 ,   2 2 i 1 4 2 i )
= 2 n 1 2 i n 1 n k = 0 ( n + 1 ) k ( n + 1 ) k ( 3 2 ) k ( 2 2 i 1 4 2 i ) k k !
( 1 n ) k = ( 1 ) k ( n 1 ) ! ( n 1 k ) !   ( 3.3 )
( 1 + n ) k = ( n + k ) ! n !   ( 3.4 )
If the equalities ( 3.3 ) ,   ( 3.4 )   are substituted in the series above, it is obtained that
J n = 2 n 1 2 i n 1 k = 0 n 1 ( 1 ) k ( n + k ) ! ( n 1 k ) ! 1 ( 2 k + 1 ) ! ( 2 2 i 1 ) k ( 2 i ) k   .
For
n 1 k 0 ,
we have
J n = 2 n 1 2 i n 1 k = 0 n 1 ( 1 ) k ( 2 2 i 1 ) k ( 2 i ) k ( n + k 2 k + 1 ) = 2 n 1 2 i n 1 k = 0 n 1 ( i 2 2 ) k ( n + k 2 k + 1 ) .
Theorem 3.4 The (2n+1)th element of the Pell sequence is expressed by hypergeometric function as
P 2 n + 1 = ( 2 n + 1 ) ( 1 ) n F ( n , 1 + n , 3 2 ; 2 ) .
Proof: We know that by Lemma 2.2
F ( a , b , c ; z ) = ( 1 z ) a F ( a , c b , c ; z z 1 ) .
By Theorem 3.2 and (2.8), we get
P 2 n + 1 = ( 2 n + 1 ) F ( 1 2 n 1 2 , 1 2 n + 1 2 , 3 2 ; 2 )
= ( 2 n + 1 ) F ( n , 1 2 n , 3 2 ; 2 )
= ( 2 n + 1 ) ( 1 ) n F ( n , 1 + n , 3 2 ; 2 ) .
Theorem 3.5 The 2nth element of the Pell sequence is expressed by hypergeometric function as
P 2 n = ( 1 ) n ( 2 n ) F ( 1 n , 1 + n , 3 2 ; 2 ) .
Proof: By Theorem 3.2 and (2.9), it is satisfied that
P 2 n = ( 2 n ) F ( 1 2 n 2 , 1 n , 3 2 ; 2 )
= ( 1 ) n 2 n F ( 1 n , 1 + n , 3 2 ; 2 ) .
Theorem 3.6 The nth element of the Pell sequence is expressed by hypergeometric function as
P n = 2 n 1 F ( 1 n 2 ,   2 n 2 ,   1 n ;   1 )
Proof: In the equality in Theorem 3.2, if we choose a = 1 n 2 , b = 2 n 2 , a + b + m = 3 2 , m = n   a n d   z = 2 , we get
P n = n Γ ( 3 2 ) Γ ( n ) Γ ( 2 + n 2 ) Γ ( 1 + n 2 ) F ( 1 n 2 ,   2 n 2 ,   1 n ; 1 )
By (2.8), the result is obtained as
P n = n 1 2 π 2 n 1 π Γ ( n 2 ) Γ ( n + 1 2 ) n 2 Γ ( n 2 ) Γ ( 1 + n 2 ) F ( 1 n 2 ,   2 n 2 ,   1 n ;   1 ) .
Theorem 3.7 The (2n+1)th element of the Pell sequence is expressed by hypergeometric function as
P 2 n + 1 = ( 2 n + 1 ) F ( n ,   1 + n ,   1 2 ; 1 )
Proof: The following equalities are satisfied by hypergeometric function
F ( a , b , c ; z ) = F ( a , b , a + b + m ; z )
F ( a , b , a + b + m ; z ) = Γ ( a + b + m ) Γ ( m ) Γ ( b + m ) Γ ( a + m ) F ( a , b , m + 1 ; 1 z )
+ ( 1 z ) m Γ ( a + b + m ) Γ ( m ) Γ ( a ) Γ ( b ) F ( b + m , a + m , m + 1 ; 1 z ) ( 3.5 )
[3]. In Theorem 3.4 and first sum of the equality (3.5), if we choose a = n , b = 1 + n , z = 2 ve a + b + m = 3 2 , we get
P 2 n + 1 = ( 2 n + 1 ) ( 1 ) n Γ ( 1 2 ) Γ ( 3 2 ) Γ ( 1 2 n ) Γ ( 3 2 + n ) F ( n ,   1 + n ,   1 2 ; 1 )
= ( 2 n + 1 ) ( 1 ) n π 1 2 π Γ ( 1 2 n ) 1 2 Γ ( 1 2 + n ) F ( n ,   1 + n ,   1 2 ; 1 )
= ( 2 n + 1 ) ( 1 ) n π π c o s n π F ( n ,   1 + n ,   1 2 ; 1 ) .
Theorem 3.8 The 2nth element of the Pell sequence is given by hypergeometric function as
P 2 n = 2 n F ( 1 n ,   1 + n ,   3 2 ;   1 ) .
Proof: In Theorem 3.5 and (3.5), if we choose a = 1 n , b = 1 + n , z = 2 , and
a + b + m = 3 2
, we get
P 2 n = ( 2 n ) ( 1 ) n Γ ( 1 2 ) Γ ( 3 2 ) Γ ( 1 2 n ) Γ ( 1 2 + n ) F ( 1 n ,   1 + n ,   3 2 ;   1 )
= ( 2 n ) ( 1 ) n 2 π 1 2 π π c o s n π F ( 1 n ,   1 + n ,   3 2 ;   1 ) .
Theorem 3.9 The (2n+1)th element of the Jacobstral sequence is found by hypergeometric function as
J 2 n + 1 = ( 2 2 i + 1 4 ) 2 n ( 2 n + 1 ) F ( 2 n ,   2 n 1 2 ,   3 2 ; 2 2 i 1 2 2 i 1 ) .
Proof: In Theorem 3.1, we substitute 2n+1 for n, we obtain
J 2 n + 1 = 2 n i 2 n ( 2 n + 1 ) F ( 2 n ,   2 n + 2 ,   3 2 ; 2 2 i 1 4 2 i ) .   ( 3.7 )
In Lemma 2.2, if we use (3.7), we get
F ( a , b , c ; z ) = F ( 2 n ,   2 n + 2 ,   3 2 ;   2 2 i 1 4 2 i )
= ( 2 2 i + 1 4 2 i ) 2 n F ( 2 n , 2 n 1 2 , 3 2 ; 2 2 i 1 4 2 i 2 2 i 1 4 2 i 1 )
= ( 2 2 i + 1 4 2 i ) 2 n F ( 2 n , 2 n 1 2 , 3 2 ; 2 2 i 1 2 2 i 1 )
Then, we use (3.7)
J 2 n + 1 = 2 n i 2 n ( 2 n + 1 ) ( 2 2 i + 1 4 2 i ) 2 n F ( 2 n , 2 n 1 2 , 3 2 ; 2 2 i 1 2 2 i 1 )
= ( 2 i ) 2 n ( 2 n + 1 ) ( 2 2 i + 1 4 2 i ) 2 n F ( 2 n , 2 n 1 2 , 3 2 ; 2 2 i 1 2 2 i 1 ) .
Theorem 3.10 The 2nth element of the Jacobstral sequence satisfies the following equality
J 2 n = ( 8 2 2 i + 1 ) 2 n + 1 n F ( 1 + 2 n , 2 n + 1 2 , 3 2 ; 2 2 i 1 2 2 i 1 ) .
Proof: In Theorem 3.1, we substitute 2n for n, we obtain
J 2 n = 2 2 n 1 2 i 2 n 1 2 n F ( 1 2 n ,   1 + 2 n , 3 2 ; 2 2 i 1 4 2 i )   ( 3.8 )
In Lemma 2.3., we use the equality (3.8). Then, we get
F ( 1 2 n , 1 + 2 n , 3 2 ; 2 2 i 1 4 2 i ) = ( 2 2 i + 1 4 2 i ) 2 n 1 F ( 1 + 2 n , 2 n + 1 2 , 3 2 ; 2 2 i 1 4 2 i 2 2 i 1 4 2 i 1 )
= ( 2 2 i + 1 4 2 i ) 2 n 1 F ( 1 + 2 n , 2 n + 1 2 , 3 2 ; 2 2 i 1 2 2 i 1 )
Then, we use (3.7) as
J 2 n = 2 2 n 1 2 i 2 n 1 2 n ( 2 2 i + 1 4 2 i ) 2 n 1 F ( 1 + 2 n , 2 n + 1 2 , 3 2 ; 2 2 i 1 2 2 i 1 )
= 2 n i 2 n 1 2 i 2 n ( 2 2 i + 1 4 2 i ) 2 n 1 F ( 1 + 2 n , 2 n + 1 2 , 3 2 ; 2 2 i 1 2 2 i 1 )
= 2 2 n i 2 n 1 2 i 2 n ( 4 2 i 2 2 i + 1 ) ( 4 2 i 2 2 i + 1 ) 2 n F ( 1 + 2 n , 2 n + 1 2 , 3 2 ; 2 2 i 1 2 2 i 1 )
= 2 n i ( 4 2 i 2 2 i + 1 ) ( 8 2 2 i + 1 ) 2 n F ( 1 + 2 n , 2 n + 1 2 , 3 2 ; 2 2 i 1 2 2 i 1 )
= n ( 8 2 2 i + 1 ) 2 n + 1 F ( 1 + 2 n , 2 n + 1 2 , 3 2 ; 2 2 i 1 2 2 i 1 ) .
Theorem 3.11 The 2nth element of the Pell sequence is denoted as
P 2 n = 2 n F ( 1 + n ,   1 2 + n ,   3 2 ;   2 )
Proof: In Theorem 3.2, we substitute 2n for n, we obtain
P 2 n = 2 n F ( 1 2 n 2 ,   1 n ,   3 2 ;   2 ) .
By Lemma 2.3 and (3.8) we get
F ( 1 2 n 2 ,   1 n ,   3 2 ;   2 ) = ( 1 2 ) 3 2 1 2 n 2 ( 1 n ) F ( 3 2 1 2 n 2 , 3 2 ( 1 n ) , 3 2 ; 2 )
= ( 1 ) 2 n F ( 1 + n , 1 2 + n , 3 2 ; 2 )
Theorem 3.12 The (2n+1)th element of the Pell sequence is demonsrated as
P 2 n + 1 = ( 2 n + 1 ) F ( 3 2 + n , 2 + n , 3 2 ; 2 ) .
Proof: In Theorem 3.2, we substitute 2n+1 for n, we get
P 2 n + 1 = ( 2 n + 1 ) F ( n ,   n 1 2 ,   3 2 ;   2 ) .   ( 3.9 )
If we use (2.10) for (3.9), we establish
F ( n ,   n 1 2 ,   3 2 ;   2 ) = ( 1 2 ) 3 2 + n ( n 1 2 ) F ( 3 2 + n , 3 2 ( n 1 2 ) , 3 2 ; 2 )
= ( 1 ) 2 n + 2 F ( 3 2 + n , 2 + n , 3 2 ; 2 )
Hence,
P 2 n + 1 = ( 2 n + 1 ) F ( n ,   n 1 2 ,   3 2 ;   2 )
= ( 2 n + 1 ) ( 1 ) 2 n + 2 F ( 3 2 + n , 2 + n , 3 2 ; 2 ) .
Theorem 3.13 The (2n+1)th element of the Jacobsthal sequence is expressed by hypergeometric function as
J 2 n + 1 = ( 2 n + 1 ) ( 2 i ) 2 n 4 2 i 2 2 i + 1 F ( 3 2 + 2 n , 2 n 1 2 , 3 2 ; 2 2 i 1 4 2 i ) .
Proof: If the linear transformation (2.10) is applied to the hypergeometric expression in (3.7), we find
F ( 2 n ,   2 n + 2 ,   3 2 ; 2 2 i 1 4 2 i )
= ( 1 2 2 i 1 4 2 i ) 3 2 ( 2 n ) ( 2 n + 2 ) F ( 3 2 ( 2 n ) , 3 2 ( 2 n + 2 ) , 3 2 ; 2 2 i 1 4 2 i )
= ( 2 2 i + 1 4 2 i ) 1 2 F ( 3 2 + 2 n , 2 n 1 2 , 3 2 ; 2 2 i 1 4 2 i ) .
If we apply this equality to (3.7), we compute
J 2 n + 1 = 2 n i 2 n ( 2 n + 1 ) ( 2 2 i + 1 4 2 i ) 1 2 F ( 3 2 + 2 n , 2 n 1 2 , 3 2 ; 2 2 i 1 4 2 i )
= 4 2 i 2 2 i + 1 ( 2 n + 1 ) ( 2 i ) 2 n F ( 3 2 + 2 n , 2 n 1 2 , 3 2 , 2 2 i 1 4 2 i )
.
Theorem 3.14 The (2n+1)th element of the Jacobsthal sequence is expressed by hypergeometric function as
J 2 n = ( 2 n ) ( 2 i ) 2 n 1 4 2 i 2 2 i + 1 F ( 1 2 + 2 n , 2 n + 1 2 , 3 2 ; 2 2 i 1 4 2 i ) .
Proof: If the linear transformation (2.10) is applied to the hypergeometric expression (3.8), we find
F ( 1 2 n ,   2 n + 1 ,   3 2 ; 2 2 i 1 4 2 i )
= ( 1 2 2 i 1 4 2 i ) 3 2 ( 1 2 n ) ( 2 n + 1 ) F ( 3 2 ( 1 2 n ) , 3 2 ( 2 n + 1 ) , 3 2 ; 2 2 i 1 4 2 i )
= ( 2 2 i + 1 4 2 i ) 1 2 F ( 1 2 + 2 n , 2 n + 1 2 , 3 2 ; 2 2 i 1 4 2 i ) .
If we apply this equality to (3.8), we evaluate
J 2 n = 2 n 1 2 i 2 n 1 ( 2 n ) ( 2 2 i + 1 4 2 i ) 1 2 F ( 1 2 + 2 n , 2 n + 1 2 , 3 2 ; 2 2 i 1 4 2 i )
= 4 2 i 2 2 i + 1 ( 2 n ) ( 2 i ) 2 n 1 F ( 1 2 + 2 n , 2 n + 1 2 , 3 2 ; 2 2 i 1 4 2 i ) .
Theorem 3.15 The 2nth element of the Pell sequence is found as
P 2 n = 2 n F ( 1 n , 1 + n , 3 2 ; 1 ) .
Proof: If 2n is written instead of n in the equation of Theorem 3.2, we get
P 2 n = 2 n F ( 1 2 n 2 ,   1 n ,   3 2 ;   2 ) .   ( 3.10 )
If we apply the linear transformation of Lemma 2.5 to (3.10), we get
F ( 1 2 n 2 ,   1 n ,   3 2 ; 2 )
= ( 1 ) 2 n 1 2 Γ ( 3 2 ) Γ ( 1 n 1 2 n 2 ) Γ ( 3 2 1 2 n 2 ) Γ ( 1 n ) F ( 1 2 n 2 , 3 2 ( 1 n ) , 1 2 n 2 ( 1 n ) + 1 ; 1 )
+ ( 1 ) ( 1 n ) Γ ( 3 2 ) Γ ( 1 2 n 2 ( 1 n ) ) Γ ( 1 2 n 2 ) Γ ( 3 2 ( 1 n ) ) F ( 1 n , 3 2 1 2 n 2 , ( 1 n ) 1 2 n 2 + 1 ; 1 )
= ( 1 ) n 1 2 Γ ( 3 2 ) Γ ( 1 2 ) Γ ( 1 + n ) Γ ( 1 n ) F ( 1 2 n , 1 2 + n , 1 2 ; 1 )
+ ( 1 ) n 1 Γ ( 3 2 ) Γ ( 1 2 ) Γ ( 1 2 n ) Γ ( 1 2 + n ) ) F ( 1 n , 1 + n , 3 2 ; 1 )
If we substitute in (3.10), we get
P 2 n = 2 n [ ( 1 ) n 1 2 Γ ( 3 2 ) Γ ( 1 2 ) Γ ( 1 + n ) Γ ( 1 n ) F ( 1 2 n , 1 2 + n , 1 2 ; 1 )
+ ( 1 ) n 1 Γ ( 3 2 ) Γ ( 1 2 ) Γ ( 1 2 n ) Γ ( 1 2 + n ) F ( 1 n , 1 + n , 3 2 ; 1 ) ] .
By
  Γ ( 1 n ) ,
the first part of the equality is undefined. Therefore, we use only the second part.
We know that Γ ( 1 2 ) = 2 π , Γ ( 3 2 ) = π 2 and by (2.1), we have Γ ( 1 2 n ) Γ ( 1 2 + n ) = π c o s ( n π ) . Hence,
P 2 n = 2 n ( 1 ) n 1 2 π π 2 π c o s ( n π ) F ( 1 n , 1 + n , 3 2 ; 1 )
= 2 n ( 1 ) n c o s ( n π ) F ( 1 n , 1 + n , 3 2 ; 1 ) .
Theorem 3.16 The (2n+1)th element of the Pell sequence is expressed by hypergeometric function as
P 2 n + 1 = ( 2 n + 1 ) F ( n , 2 + n , 3 2 ; 1 ) .
Proof: If we apply the linear transformation in Lemma 2.5 to the hypergeometric expression in equation (3.9), we obtain
F ( n ,   n 1 2 ,   3 2 ;   2 )
= ( 1 ) n Γ ( 3 2 ) Γ ( n 1 2 + n ) Γ ( 3 2 + n ) Γ ( n 1 2 ) F ( n , 3 2 ( n 1 2 ) , n ( n 1 2 ) + 1 ; 1 )
+ ( 1 ) n + 1 2 Γ ( 3 2 ) Γ ( n ( n 1 2 ) ) Γ ( n ) Γ ( 3 2 ( n 1 2 ) ) F ( n 1 2 , 3 2 + n , n 1 2 + n + 1 ; 1 )
= ( 1 ) n Γ ( 3 2 ) Γ ( 1 2 ) Γ ( 3 2 + n ) Γ ( n 1 2 ) F ( n , 2 + n , 3 2 ; 1 )
+ ( 1 ) n + 1 2 Γ ( 3 2 ) Γ ( 1 2 ) Γ ( n ) Γ ( 2 + n ) F ( n 1 2 , 3 2 + n , 1 2 ; 1 ) .
If we substitute this equality in (3.9), we have
P 2 n + 1 = ( 2 n + 1 ) [ ( 1 ) n Γ ( 3 2 ) Γ ( 1 2 ) Γ ( 3 2 + n ) Γ ( n 1 2 ) F ( n , 2 + n , 3 2 ; 1 )
+ ( 1 ) n + 1 2 Γ ( 3 2 ) Γ ( 1 2 ) Γ ( n ) Γ ( 2 + n ) F ( n 1 2 , 3 2 + n , 1 2 ; 1 ) ] .
By   Γ ( n ) , the second part of the equality is undefined. Therefore, we use only the first part. We know that Γ ( 1 2 ) = 2 π , Γ ( 3 2 ) = π 2 and by (2.1), Γ ( 1 2 n ) Γ ( 3 2 + n ) = π c o s ( n π ) . Therefore, the following is satisfied:
P 2 n + 1 = ( 2 n + 1 ) ( 1 ) n 2 π π 2 π c o s ( n π ) F ( n , 2 + n , 3 2 ; 1 )
= ( 2 n + 1 ) ( 1 ) n c o s ( n π ) F ( n , 2 + n , 3 2 ; 1 ) .
Theorem 3.17 The (2n+1)th element of the Jacobsthal sequence is computed as
J 2 n + 1 = ( 2 2 i + 1 ) 2 n F ( 2 n , 1 2 2 n , 4 n 1 ; 4 2 i 2 2 i + 1 ) .
Proof: If we apply the linear transformation Lemma 2.5 to the hypergeometric expression in (3.7),
F ( 2 n ,   2 n + 2 ,   3 2 ;   2 2 i 1 4 2 i )
= ( 2 2 i + 1 4 2 i ) 2 n Γ ( 3 2 ) Γ ( 2 n + 2 + 2 n ) Γ ( 3 2 + 2 n ) Γ ( 2 n + 2 ) F ( 2 n , 3 2 2 n 2 , 2 n 2 n 2 + 1 ; 4 2 i 2 2 i + 1 )
+ ( 2 2 i + 1 4 2 i ) 2 n 2 Γ ( 3 2 ) Γ ( 2 n 2 n 2 ) Γ ( 2 n ) Γ ( 3 2 2 n 2 ) F ( 2 n + 2 , 3 2 + 2 n , 2 n + 2 + 2 n + 1 ; 4 2 i 2 2 i + 1 )
= ( 2 2 i + 1 4 2 i ) 2 n Γ ( 3 2 ) Γ ( 4 n + 2 ) Γ ( 3 2 + 2 n ) Γ ( 2 n + 2 ) F ( 2 n , 1 2 2 n , 4 n 1 ; 4 2 i 2 2 i + 1 )
+ ( 2 2 i + 1 4 2 i ) 2 n 2 Γ ( 3 2 ) Γ ( 4 n 2 ) Γ ( 2 n ) Γ ( 1 2 2 n ) F ( 2 n + 2 , 3 2 + 2 n , 4 n + 3 ; 4 2 i 2 2 i + 1 ) .
By   Γ ( n ) , the second part of the equality is undefined. Therefore, we use only the first part. By (3.2), we get
Γ ( 4 n + 2 ) = 2 4 n + 1 π Γ ( 2 n + 1 ) Γ ( 3 2 + 2 n ) ,
Γ ( 2 n + 2 ) = 2 2 n + 1 π Γ ( n + 1 ) Γ ( 3 2 + n ) ,
Γ ( 2 n + 1 ) = 2 2 n π Γ ( n + 1 2 ) Γ ( n + 1 )
.
By these equalities above, we have
F ( 2 n ,   2 n + 2 ,   3 2 ;   2 2 i 1 4 2 i )
= ( 2 2 i + 1 4 2 i ) 2 n π 2 2 4 n + 1 π 2 2 n π Γ ( n + 1 2 ) Γ ( n + 1 ) Γ ( 3 2 + 2 n ) Γ ( 3 2 + 2 n ) 2 2 n + 1 π Γ ( n + 1 ) Γ ( 3 2 + n ) F ( 2 n , 1 2 2 n , 4 n 1 ; 4 2 i 2 2 i + 1 )
= ( 2 2 i + 1 4 2 i ) 2 n π 2 2 4 n + 1 π 2 2 n π 2 2 n + 1 π ( n + 1 2 ) F ( 2 n , 1 2 2 n , 4 n 1 ; 4 2 i 2 2 i + 1 )
.
If we substitute the equality of F ( 2 n ,   2 n + 2 ,   3 2 ;   2 2 i 1 4 2 i ) in (3.7), we have
J 2 n + 1 = 2 n i 2 n ( 2 n + 1 ) ( 2 2 i + 1 4 2 i ) 2 n π 2 2 4 n + 1 π 2 2 n π 2 2 n + 1 π ( n + 1 2 ) F ( 2 n , 1 2 2 n , 4 n 1 ; 4 2 i 2 2 i + 1 )
= 2 n i 2 n ( 2 n + 1 ) ( 2 2 i + 1 4 2 i ) 2 n 2 4 n 1 2 n + 1 F ( 2 n , 1 2 2 n , 4 n 1 ; 4 2 i 2 2 i + 1 )
Theorem 3.18 The 2nth element of the Jacobsthal sequence is expressed by hypergeometric function as
J 2 n   = 1 8 n 1 2 2 i + 1 [ ( 2 2 i + 1 4 2 ) 2 n F ( 1 2 n , 1 2 2 n , 4 n + 1 ; 4 2 i 2 2 i + 1 )
( 4 2 2 2 i + 1 ) 2 n F ( 1 + 2 n , 1 2 + 2 n , 4 n + 1 ; 4 2 i 2 2 i + 1 ) ]
Proof: If we apply the linear transformation Lemma 2.5 to the hypergeometric expression in (3.8),
F ( 1 2 n ,   1 + 2 n , 3 2 ; 2 2 i 1 4 2 i )
= ( 2 2 i + 1 4 2 i ) 2 n 1 Γ ( 3 2 ) Γ ( 1 + 2 n 1 + 2 n ) Γ ( 3 2 1 + 2 n ) Γ ( 1 + 2 n ) F ( 1 2 n , 3 2 1 2 n , 1 2 n 1 2 n + 1 ; 4 2 i 2 2 i + 1 )
+ ( 2 2 i + 1 4 2 i ) 1 2 n Γ ( 3 2 ) Γ ( 1 2 n 1 2 n ) Γ ( 1 2 n ) Γ ( 3 2 1 2 n ) F ( 1 + 2 n , 3 2 1 + 2 n , 1 + 2 n 1 + 2 n + 1 ; 4 2 i 2 2 i + 1 )
= ( 2 2 i + 1 4 2 i ) 2 n 1 Γ ( 3 2 ) Γ ( 4 n ) Γ ( 1 2 + 2 n ) Γ ( 1 + 2 n ) F ( 1 2 n , 1 2 2 n , 4 n + 1 ; 4 2 i 2 2 i + 1 )
+ ( 2 2 i + 1 4 2 i ) 1 2 n Γ ( 3 2 ) Γ ( 4 n ) Γ ( 1 2 n ) Γ ( 1 2 2 n ) F ( 1 + 2 n , 1 2 + 2 n , 4 n + 1 ; 4 2 i 2 2 i + 1 )
By (2.2), we get
Γ ( 4 n ) = 2 4 n 1 π Γ ( 2 n ) Γ ( 1 2 + 2 n ) , Γ ( 2 n + 1 ) = 2 n Γ ( 2 n ) ,
Γ ( 3 2 ) = π 2 , Γ ( 4 n ) = 2 4 n 1 π Γ ( 2 n ) Γ ( 1 2 2 n ) , a n d Γ ( 1 2 n ) = 2 n Γ ( 2 n )
If we substitute these values in the equation above, we obtain
F ( 1 2 n ,   1 + 2 n , 3 2 ; 2 2 i 1 4 2 i )
= ( 2 2 i + 1 4 2 i ) 2 n 1 π 2 2 4 n 1 π Γ ( 2 n ) Γ ( 1 2 + 2 n ) Γ ( 1 2 + 2 n ) 2 n Γ ( 2 n ) F ( 1 2 n , 1 2 2 n , 4 n + 1 ; 4 2 i 2 2 i + 1 )
+ ( 2 2 i + 1 4 2 i ) 1 2 n π 2 2 4 n 1 π Γ ( 2 n ) Γ ( 1 2 2 n ) 2 n Γ ( 2 n ) Γ ( 1 2 2 n ) F ( 1 + 2 n , 1 2 + 2 n , 4 n + 1 ; 4 2 i 2 2 i + 1 )
= ( 2 2 i + 1 4 2 i ) 2 n 1 π 2 2 4 n 1 π Γ ( 2 n ) Γ ( 1 2 + 2 n ) Γ ( 1 2 + 2 n ) 2 n Γ ( 2 n ) F ( 1 2 n , 1 2 2 n , 4 n + 1 ; 4 2 i 2 2 i + 1 )
+ ( 2 2 i + 1 4 2 i ) 1 2 n π 2 2 4 n 1 π Γ ( 2 n ) Γ ( 1 2 2 n ) 2 n Γ ( 2 n ) Γ ( 1 2 2 n ) F ( 1 + 2 n , 1 2 + 2 n , 4 n + 1 ; 4 2 i 2 2 i + 1 ) .
J 2 n = 2 2 n 1 2 i 2 n 1 2 n [ ( 2 2 i + 1 4 2 i ) 2 n 1 π 2 2 4 n 1 π Γ ( 2 n ) Γ ( 1 2 + 2 n ) Γ ( 1 2 + 2 n ) 2 n Γ ( 2 n ) F ( 1 2 n , 1 2 2 n , 4 n + 1 ; 4 2 i 2 2 i + 1 )
+ ( 2 2 i + 1 4 2 i ) 1 2 n π 2 2 4 n 1 π Γ ( 2 n ) Γ ( 1 2 2 n ) 2 n Γ ( 2 n ) Γ ( 1 2 2 n ) F ( 1 + 2 n , 1 2 + 2 n , 4 n + 1 ; 4 2 i 2 2 i + 1 ) ]
= 1 8 n 1 2 2 i + 1 [ ( 2 2 i + 1 4 2 ) 2 n F ( 1 2 n , 1 2 2 n , 4 n + 1 ; 4 2 i 2 2 i + 1 )
( 4 2 2 2 i + 1 ) 2 n F ( 1 + 2 n , 1 2 + 2 n , 4 n + 1 ; 4 2 i 2 2 i + 1 ) ]
.

4. Discussion and Conclusions

The results demonstrate that hypergeometric functions are not only a topic of special function theory but also a powerful expression tool in areas such as integer sequences, combinatorics, and numerical analysis. The proposed representations provide analytical solutions that can be used in theoretical analysis and structures that can facilitate algorithmic computations.
The results obtained here demonstrate the relationship between hypergeometric functions and special integer sequences, and suggest that further research is possible in this area. While Pell and Jacobsthal sequences are examined in detail, broader structures such as Horadam family are also open to investigation in terms of hypergeometric representations. Similar transformations can be developed for both classical and q-analog versions of these sequences.
Most of the proposed representations have been evaluated at the analytically. However, the numerical equivalents of these structures have not been investigated thoroughly. Future work could consider integrating the proposed representations into approximate computation methods, algorithmic typesetting, and computerized proof systems. Furthermore, the usability of the resulting transformations in applied fields such as cryptography, signal processing, and combinatorial structure analysis can be investigated.

Author Contributions

“Conceptualization, S.U. and B.A.; methodology, H.A.; software, B.A.; validation, S.U, B.A. and H.A.; formal analysis, S.U.; investigation, B.A.; resources, H.A.; data curation, S.U.; writing—original draft preparation, B.A.; writing—review and editing, S.U.; visualization, H.A.; supervision, S.U. All authors have read and agreed to the published version of the manuscript.

Conflicts of Interest

The authors declare no conflict of interest.

References

  1. Andrews, G. E.; Askey, R.; Roy, R. Special Functions; Cambridge Univ. Press: Cambridge, 1999. [Google Scholar]
  2. Bell, W. W. Special Functions for Scientists and Engineers; D. Van Nostrand: Princeton, NJ, 1968. [Google Scholar]
  3. Dilcher, K. Hypergeometric functions and Fibonacci numbers  . In Fibonacci Quart.; Volume 38, 4, pp. 342–363.
  4. Chu, W. Hypergeometric series and Fibonacci numbers  . J. Math. Res. Exposition 2010, 30(1), 41–50. [Google Scholar]
  5. Horadam, A. F. Jacobsthal representation numbers  . Fibonacci Quart. 1996, 37(2), 40–54. [Google Scholar] [CrossRef]
  6. Koshy, T. Pell and Pell–Lucas Numbers with Applications; Springer: Berlin, 2014. [Google Scholar]
  7. Olver, F. W. J.; Lozier, D. W.; Boisvert, R. F.; Clark, C. W. NIST Handbook of Mathematical Functions; Cambridge Univ. Press: Cambridge, 2010. [Google Scholar]
  8. Temme, N. M. Special Functions: An Introduction to the Classical Functions of Mathematical Physics; Wiley: New York, 1996. [Google Scholar]
  9. Uygun, S. The relation between Chebyshev polynomials and Jacobsthal and Jacobsthal–Lucas sequences  . Sakarya Univ. J. Sci. 2020, 24(6), 1162–1170. [Google Scholar] [CrossRef]
  10. Roy, R. Binomial identities and hypergeometric series  . Amer. Math. Monthly 1987, 94(1), 36–46. [Google Scholar] [CrossRef]
Disclaimer/Publisher’s Note: The statements, opinions and data contained in all publications are solely those of the individual author(s) and contributor(s) and not of MDPI and/or the editor(s). MDPI and/or the editor(s) disclaim responsibility for any injury to people or property resulting from any ideas, methods, instructions or products referred to in the content.
Copyright: This open access article is published under a Creative Commons CC BY 4.0 license, which permit the free download, distribution, and reuse, provided that the author and preprint are cited in any reuse.
Prerpints.org logo

Preprints.org is a free preprint server supported by MDPI in Basel, Switzerland.

Subscribe

Disclaimer

Terms of Use

Privacy Policy

Privacy Settings

© 2025 MDPI (Basel, Switzerland) unless otherwise stated