Factoriangular number

Uses your system voice; voice and rate in settings.

Snapshot

≈ 3 min read

Names in other languages

No names in other languages are held for this entry yet.

Article bodies are English and are not machine-translated. A name in another language is not a translation of the article.

In number theory, a factoriangular number is an integer formed by adding a factorial and a triangular number with the same index. The name is a portmanteau of "factorial" and "triangular."

In number theory, a factoriangular number is an integer formed by adding a factorial and a triangular number with the same index. The name is a portmanteau of "factorial" and "triangular." \operatorname{Ft}_n = n! + T_n = n! + \frac{n(n+1)}{2} . The first few factoriangular numbers are: These numbers form the integer sequence A101292 in the Online Encyclopedia of Integer Sequences (OEIS). \operatorname{Ft}_{n+1} = (n+1)\left(\operatorname{Ft}_n - \frac{n^2-2}{2}\right) And for n \geq 2 , \operatorname{Ft}_n = n\left(\operatorname{Ft}_{n-1} - \frac{n^2-2n-1}{2}\right) These are linear non-homogeneous recurrence relations with variable coefficients of order 1. The exponential generating function E(x) = \sum_{n=0}^\infty \operatorname{Ft}_n \tfrac{x^n}{n!} for factoriangular numbers is (for -1 ) E(x) = \frac{2 + (2-5x^2+2x^3+x^4)e^x}{2(1-x)^2} If the sequence is extended to include \operatorname{Ft}_0 = 1 , then the exponential generating function becomes E(x) = \frac{2 + (2x-x^2-x^3)e^x}{2(1-x)} . \operatorname{Ft}_n = 2T_n if and only if n = 1 or n = 3 . \operatorname{Ft}_n = T_x + T_n if and only if 8n! + 1 is a perfect square. For n \neq x , the only known solution is (\operatorname{Ft}_5, T_{15}) = (135, 120) , giving \operatorname{Ft}_5 = T_5 + T_{15} . \operatorname{Ft}_n = T_x + T_y if and only if 8\operatorname{Ft}_n + 2 is a sum of two squares. \operatorname{Ft}_1 = 2 = 1^2 + 1^2 \operatorname{Ft}_2 = 5 = 1^2 + 2^2 \operatorname{Ft}_4 = 34 = 3^2 + 5^2 \operatorname{Ft}_9 = 362,925 = 195^2 + 570^2 This result is related to the sum of two squares theorem, which states that a positive integer can be expressed as a sum of two squares if and only if its prime factorization contains no prime factor of the form 4k+3 raised to an odd power. \operatorname{Ft}_1 = 2 = F_3 \operatorname{Ft}_2 = 5 = F_5 \operatorname{Ft}_4 = 34 = F_9 This result was conjectured by Romer Castillo and later proved by Ruiz and Luca. A Pell factoriangular number is a number that is both a Pell number and a factoriangular number. Luca and Gómez-Ruiz proved that there are exactly three such numbers: \operatorname{Ft}_1 = 2 , \operatorname{Ft}_2 = 5 , and \operatorname{Ft}_3 = 12 . The concept of factoriangular numbers can be generalized to (n,k) -factoriangular numbers, defined as \operatorname{Ft}_{n,k} = n! + T_k where n and k are positive integers. The original factoriangular numbers correspond to the case where n = k . This generalization gives rise to factoriangular triangles, which are Pascal-like triangular arrays of numbers. Two such triangles can be formed: A triangle with entries \operatorname{Ft}_{n,k} where k \leq n , yielding the sequence: 2, 3, 5, 7, 9, 12, 25, 27, 30, 34, ... A triangle with entries \operatorname{Ft}_{n,k} where k \geq n , yielding the sequence: 2, 4, 5, 7, 8, 12, 11, 12, 16, 34, ... In both cases, the diagonal entries (where n = k ) correspond to the original factoriangular numbers.

Text derived from https://en.wikipedia.org/w/index.php?oldid=1357964612 under CC BY-SA 4.0; modifications have been made.

Sources cited in this revision

1 named source(s) extracted from the cited revision. A source with no author is shown by its publication; nothing is invented.