The Stern diatomic sequence via generalized Chebyshev polynomials
From MaRDI portal
Publication:4575265
Abstract: Let a(n) be the Stern's diatomic sequence, and let x1,...,xr be the distances between successive 1's in the binary expansion of the (odd) positive integer n. We show that a(n) is obtained by evaluating generalized Chebyshev polynomials when the variables are given the values x1+1, ..., xr+1, and we derive a formula expressing the same polynomials in terms of sets of increasing integers of alternating parity. We also show that a(n) = Det(Ir + Mr), where Ir is the rxr identity matrix, and Mr is the rxr matrix that has x1,...,xr along the main diagonal, then all 1's just above and below the main diagonal, and all the other entries are 0.
Recommendations
Cites work
- scientific article; zbMATH DE number 5252692 (Why is no real title available?)
- A correlation identity for Stern's sequence
- Cluster algebras. I: Foundations
- Cluster multiplication in regular components via generalized Chebyshev polynomials.
- On the eigenvalue problem for a particular class of finite Jacobi matrices
- Recounting the Rationals
- Regularity properties of the Stern enumeration of the rationals
- Stern's diatomic sequence \(0, 1, 1, 2, 1, 3, 2, 3, 1, 4, \dots \)
- Upper bounds for Stern's diatomic sequence and related sequences
This page was built for publication: The Stern diatomic sequence via generalized Chebyshev polynomials
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4575265)