Invariant sequences under binomial transformation
The classical binomial inversion formula states that NEWLINE\[NEWLINE\alpha_n= \sum^n_{k=0} {n\choose k}(-1)^k b_k\qquad (n= 0,1,2,\dots)\qquad\text{if and only if}NEWLINE\]NEWLINE NEWLINE\[NEWLINEb_n= \sum^n_{k=0} {n\choose k}(-1)^k \alpha_k\qquad (n= 0,1,2,\dots).NEWLINE\]NEWLINE In the present paper the author studies those sequences \(\{\alpha_n\}\) which satisfy the relation NEWLINE\[NEWLINE\sum^n_{k=0} {n\choose k}(-1)^k \alpha_k= +\alpha_n\qquad (n= 0,1,2,\dots)NEWLINE\]NEWLINE and those which satisfy the relation NEWLINE\[NEWLINE\sum^n_{k=0} {n\choose k}(-1)^k \alpha_k= -\alpha_n\qquad (n= 0,1,2,\dots).NEWLINE\]NEWLINE A sequence, which satisfies the first relation, is called invariant sequence (IS), and a sequence, which satisfies the second, is called inverse invariant sequence (IIS). The author notes that \(\{\alpha_n\}\in \text{ISS}\) if and only if \(\alpha_0= 0\) and either \(\{\alpha_{n+1}/(n+ 1)\}\) or \(\{n\alpha_{n-1}\}\in \text{IS}\). He also notes that \(\{1/2^n\}\), \(\{[nF_{n-1}\}\), \(\{L_n\}\) and \(\{(-1)^n B_n\}\) are invariant sequences, where \(F_n\), \(L_n\), and \(B_n\) denote the Fibonacci, Lucas and Bernoulli numbers. Finally, he proves a number of results among which we mention the following. NEWLINENEWLINETheorem 3.2: Let \(A^*(x)\) be the exponential generating function of \(\{A_n\}\). Then \(\{A_n\}\in \text{IS}\) if and only if \(A^*(x) e^{-x/2}\) is an even function, and \(\{A_n\}\in \text{IIS}\) if and only if \(A^*(x) e^{-x/2}\) is an odd function. NEWLINENEWLINETheorem 5.1: Let \(\{a_n\}\), \(\{b_n\}\) and \(\{c_n\}\) be three nonzero sequences satisfying NEWLINE\[NEWLINEc_n= [1/(n+ 1)]= \sum^n_{k=0} a_k b_{n-k}\qquad (n= 0,1,2,\dots).NEWLINE\]NEWLINE If two of the three sequences are invariant sequences, then the other sequence is also an invariant sequence.
- scientific article; zbMATH DE number 3918724
- On a generalization of the binomial sequence transformations
- Congruences of multiple sums involving invariant sequences under binomial transform
- Invariant sequences of few discrete transforms
- Binomial transform and Dold sequences
- A note about invariant polynomial transformations of integer sequences
- Transforming recurrent sequences by using the binomial and invert operators
- scientific article; zbMATH DE number 5693948
- On some combinatorial sequences associated to invariant theory
- scientific article; zbMATH DE number 4063446
- Combinatorial identities in dual sequences
- Inverse relations in Shapiro's open questions
- (\(\pm 1\))-invariant sequences and truncated Fibonacci sequences
- The dual of number sequences, Riordan polynomials, and Sheffer polynomials
- Pascal eigenspaces and invariant sequences of the first or second kind
- Riordan group involutions
- A symbolic approach to some identities for Bernoulli-Barnes polynomials
- Invariants on a set of reciprocal iterated exponential power coefficients
- Invariant sequences of few discrete transforms
- Identities and congruences for Catalan-Larcombe-French numbers
- Applications of Riordan matrix functions to Bernoulli and Euler polynomials
- Congruences of multiple sums involving invariant sequences under binomial transform
- scientific article; zbMATH DE number 146972 (Why is no real title available?)
- Generalization of an identity of Apostol
- scientific article; zbMATH DE number 883266 (Why is no real title available?)
- scientific article; zbMATH DE number 896424 (Why is no real title available?)
- An identity for generalized Bernoulli polynomials
- Some further properties of even and odd sequences
- A note about invariant polynomial transformations of integer sequences
- scientific article; zbMATH DE number 2213551 (Why is no real title available?)
- A note on a transform to self-inverse sequences
- Generalized Legendre polynomials and related supercongruences
- Symmetric recurrence relations and binomial transforms
- Summation formulae on reciprocal sequences
- Identities from the binomial transform
This page was built for publication: Invariant sequences under binomial transformation
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2746560)
