Papers
Topics
Authors
Recent
Search
2000 character limit reached

The Stern diatomic sequence via generalized Chebyshev polynomials

Published 8 Nov 2015 in math.NT | (1511.02422v2)

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.

Summary

Paper to Video (Beta)

Whiteboard

No one has generated a whiteboard explanation for this paper yet.

Open Problems

We haven't generated a list of open problems mentioned in this paper yet.

Continue Learning

We haven't generated follow-up questions for this paper yet.

Authors (1)

Collections

Sign up for free to add this paper to one or more collections.