Samiksha Jaiswal (Editor)

Fibonorial

Updated on
Edit
Like
Comment
Share on FacebookTweet on TwitterShare on LinkedInShare on Reddit

In mathematics, the Fibonorial n!F, also called the Fibonacci factorial, where n is a nonnegative integer, is defined as the product of the first n positive Fibonacci numbers, i.e.

Contents

n ! F := i = 1 n F i , n 0 ,

where Fi is the ith Fibonacci number, and 0!F gives the empty product (defined as the multiplicative identity, i.e. 1).

The Fibonorial n!F is defined analogously to the factorial n!. The Fibonorial numbers are used in the definition of Fibonomial coefficients (or Fibonacci-binomial coefficients) similarly as the factorial numbers are used in the definition of binomial coefficients.

Asymptotic behaviour

The series of fibonorials is asymptotic to a function of the golden ratio ϕ : n ! F C ϕ n . ( n + 1 ) / 2 5 n / 2 ,

where the fibonorial constant C is defined by C = k = 1 ( 1 a k ) , avec a = 1 ϕ 2 et où ϕ est encore le nombre d'or.

An approximate truncated value of C is 1.226742010720 (see (sequence A062073 in the OEIS) for more digits).

Almost-Fibonorial numbers

Almost-Fibonorial numbers: n!F − 1.

Almost-Fibonorial primes: prime numbers among the almost-Fibonorial numbers.

Quasi-Fibonorial numbers

Quasi-Fibonorial numbers: n!F + 1.

Quasi-Fibonorial primes: prime numbers among the quasi-Fibonorial numbers.

Connection with the q-Factorial

The fibonorial can be expressed in terms of the q-factorial and the golden ratio ϕ = 1 + 5 2 :

n ! F = ϕ ( n 2 ) [ n ] 1 / ϕ 2 !

Sequences

 A003266 Product of first n nonzero Fibonacci numbers F(1), ..., F(n).

 A059709 and  A053408 for n such that n!F − 1 and n!F + 1 are primes, respectively.

References

Fibonorial Wikipedia