Euler-Seidel method for certain combinatorial numbers and a new characterization of Fibonacci sequence (Q1040207): Difference between revisions
From MaRDI portal
Created a new Item |
Added link to MaRDI item. |
||
links / mardi / name | links / mardi / name | ||
Revision as of 23:47, 30 January 2024
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | Euler-Seidel method for certain combinatorial numbers and a new characterization of Fibonacci sequence |
scientific article |
Statements
Euler-Seidel method for certain combinatorial numbers and a new characterization of Fibonacci sequence (English)
0 references
24 November 2009
0 references
Given a sequence \(a_n\), the Euler-Seidel matrix of this sequence is defined recursively as \(a_n^0=a_n\) for \(n\geq 0\), and \(a_n^k=a_n^{k-1}+a_{n+1}^{k-1}\) for \(n\geq 0, k\geq 1\). The paper studies \(r\)-Stirling numbers and hyperharmonic numbers in the context of Euler-Seidel matrices and expresses the exponential generating function of hyperharmonic numbers in terms of hypergeometric functions.
0 references
Euler-Seidel matrix
0 references
hyperharmonic numbers
0 references
\(r\)-Stirling numbers
0 references
Fibonacci numbers
0 references
hypergeometric functions
0 references