Letting $(t_n)$ denote the Thue-Morse sequence with values $0, 1$, we note that the Woods-Robbins product $$ \prod_{n \geq 0} \left(\frac{2n+1}{2n+2}\right)^{(-1)^{t_n}} = 2^{-1/2} $$ involves a rational function in $n$ and the $\pm 1$ Thue-Morse sequence $((-1)^{t_n})_{n \geq 0}$. The purpose of this paper is twofold. On the one hand, we try to find other rational functions for which similar infinite products involving the $\pm 1$ Thue-Morse sequence have an expression in terms of known constants. On the other hand, we also try to find (possibly different) rational functions $R$ for which the infinite product $\prod R(n)^{t_n}$ also has an expression in terms of known constants.
Nous décrivons quelques résultats récents sur la suite de Thue-Morse, ainsi que des questions ou conjectures, dont l'une, due à Shevelev, est résolue dans cet article. We describe some recent results on the Thue-Morse sequence. We also list open questions and conjectures, one of which is due to Shevelev and proved in this paper.
First we generalize the Thue-Morse sequence (the generalized Thue-Morse sequences) by a cyclic permutations and p-adic system, and consider the necessary-sufficient condition that it is non-periodic. Moreover if the generalized Thue-Morse sequence is not periodic, then all equally spaced subsequences of the generalized Thue-Morse sequences are not periodic. Finally we apply recently combinatorial transcendence results to the generalized non-periodic Thue-Morse sequence, we can found many transcendental numbers.
The Thue-Morse sequence is generalized to the $TM_m$ sequences and two equivalent definitions are given. This generalization leads to transcendental numbers and has Queffélec's theorem on Thue-Morse continued fractions as a special case. It is also shown that the theorem of Adamczewski and Bugeaud for palindromic continued fractions cannot be applied in this case.
We define a morphism based upon a Latin square that generalizes the Thue-Morse morphism. We prove that fixed points of this morphism are overlap-free sequences generalizing results of Allouche - Shallit and Frid.
We define the category $Rec(\mathbb K)$ of recurrence matrices over a field $\mathbb K$ and use it to calculate determinants of Hankel matrices related to the Thue-Morse sequence.
In this paper we study sums of Dirichlet series whose coefficients are terms of the Thue-Morse sequence and variations thereof. We find closed-form expressions for such sums in terms of known constants and functions including the Riemann zeta function and the Dirichlet eta function using elementary methods.
Let $a, b$ be distinct, non-constant polynomials in ${\mathbb F}_2 [z]$. Let $ξ_{a, b}$ be the power series in ${\mathbb F}_2((z^{-1}))$ whose sequence of partial quotients is the Thue-Morse sequence over $\{a, b\}$. We establish that $ξ_{a,b}$ is algebraic of degree $4$.
A novel generalization of the Prouhet-Thue-Morse sequence to binary $\pm 1$-weight sequences is presented. Derived from Rademacher functions, these weight sequences are shown to satisfy interesting orthogonality and recurrence relations. In addition, a result useful in describing these weight sequences as sidelobes of Doppler tolerant waveforms in radar is established.
We show that the Möbius function is orthogonal to the Thue-Morse sequence $t(n)$ taken along the Piatetski-Shapiro numbers $\lfloor n^c \rfloor$ for any $1 < c < 2$. Previously this property was established for the subsequence along the squares $t(n^2)$. These are both examples of Möbius orthogonal sequences with maximum entropy.
Infinite products associated with the $\pm 1$ Thue-Morse sequence whose value is rational or algebraic irrational have been studied by several authors. In this short note we prove three new infinite product identities involving $π$, $\sqrt{2}$, and the $\pm 1$ Thue-Morse sequence, building on a result by Allouche, Riasat, and Shallit. We then use our method to find a new expression for a product appearing within the context of the Flajolet-Martin constant.
For every $a\geq1$ we give a recursion algorithm of building of set of solutions of equations of the form $t(x+a)=t(x)$ and $t(x+a)=1-t(x),$ where $\{t(n)\}$ is Thue-Morse sequence. We pose an open problem and two conjectures.
In a recent paper, Baker and Kong have studied the Hausdorff dimension of the intersection of Cantor sets with their translations. We extend their results to more general Cantor sets. The proofs rely on the frequencies of digits in unique expansions in non-integer bases. In relation with this, we introduce a practical method to determine the frequency of any given finite block in Thue--Morse type sequences.
We revisit the relation between the von Koch curve and the Thue-Morse sequence given in a recent paper of Ma and Goldener by relating their study to papers written by Coquet and Dekking at the beginning of the 80s. We also emphasize that more general links between fractal objects and automatic sequences can be found in the literature.
This paper naturally extends and generalizes our previous work "Thue-Morse constant is not badly approximable", arXiv:1407.3182 [math.NT]. Here we consider the Laurent series $f_d(x) = \prod_{n=0}^\infty (1 - x^{-d^n})$, $d\in\mathbb{N}$, $d\geq 2$ which generalize the generating function $f_2(x)$ of the Thue-Morse number, and study their continued fraction expansion. In particular, we show that the convergents of $x^{-d+1}f_d(x)$ have quite a regular structure. We address as well the question whether the corresponding Mahler numbers $f_d(a)\in\mathbb{R}$, $a,d\in\mathbb{N}$, $a,d\geq 2$, are …
We prove that for $1<c<4/3$ the subsequence of the Thue--Morse sequence $\mathbf t$ indexed by $\lfloor n^c\rfloor$ defines a normal sequence, that is, each finite sequence $(\varepsilon_0,\ldots,\varepsilon_{T-1})\in \{0,1\}^T$ occurs as a contiguous subsequence of the sequence $n\mapsto \mathbf t\left(\lfloor n^c\rfloor\right)$ with asymptotic frequency $2^{-T}$.
We prove that Thue-Morse constant $τ_{TM}=0.01101001..._2$ is not a badly approximable number. Moreover, we prove that $τ_{TM}(a)=0.01101001..._a$ is not badly approximable for every integer base $a\geq 2$ such that $a$ is not divisible by 15. At the same time we provide a precise formula for convergents of the Laurent series $\tilde{f}_{TM}(z) = z^{-1}\prod_{n=1}^\infty (1-z^{-2^n})$, thus developing further the research initiated by Alf van der Poorten and others.
We obtain the explicit evaluations of the Hankel determinants of the formal power series $\prod_{k\geq 0}(1+Jx^{3^{k}})$ where $J={(\sqrt{-3}-1)}/2$, and prove that the sequence of Hankel determinants is an aperiodic automatic sequence taking value in $\{0, \pm 1, \pm J, \pm J^2\}$. This research is essentially inspired by the works about Hankel determinants of Thue--Morse-like sequences by Allouche, Peyrière, Wen and Wen (1998), Bacher (2006) and the first author (2013).
Let $b \ge 2$ and $\ell \ge 1$ be integers. We establish that there is an absolute real number $K$ such that all the partial quotients of the rational number $$ \prod_{h = 0}^\ell \, (1 - b^{-2^h}), $$ of denominator $b^{2^{\ell+1} - 1}$, do not exceed $\exp(K (\log b)^2 \sqrt{\ell} 2^{\ell/2})$.
We consider a numeration system in the ring of integers ${\mathcal O}_K$ of a number field, which we assume to be principal. We prove that the property of being a prime in ${\mathcal O}_K$ is decorrelated from two fundamental examples of automatic sequences relative to the chosen numeration system: the Thue-Morse and the Rudin-Shapiro sequences. This is an analogue, in ${\mathcal O}_K$, of results of Mauduit-Rivat which were concerned with the case $K={\mathbb Q}$.
We introduce and study two analogs of one of the best known sequence in Mathematics : Thue-Morse sequence. The first analog is concerned with the parity of number of runs of 1's in the binary representation of nonnegative integers. The second one is connected with the parity of number of 1's in the representation of nonnegative integers in so-called negabinary (or in base $-2).$ We give for them some recurrent and structure formulas and prove that the second $(0,1)$-sequence is cube-free, while the first one is quint-free. Finally we consider several interesting unsolved problems.
Given an integer $q\ge2$ and $θ_1,\cdots,θ_{q-1}\in\{0,1\}$, let $(θ_n)_{n\ge0}$ be the generalized Thue-Morse sequence, defined to be the unique fixed point of the morphism $$0\mapsto0θ_1\cdotsθ_{q-1}$$ $$1\mapsto1\overlineθ_1\cdots\overlineθ_{q-1}$$ beginning with $θ_0:=0$, where $\overline{0}:=1$ and $\overline{1}:=0$. For rational functions $R$, we study infinite products of the forms $$\prod_{n=1}^\infty\Big(R(n)\Big)^{(-1)^{θ_n}}\quad\text{and}\quad\prod_{n=1}^\infty\Big(R(n)\Big)^{θ_n}.$$ This generalizes relevant results given by Allouche, Riasat and Shallit in 2019 on infinite product…
Let $p$ be a prime number and $ξ$ an irrational $p$-adic number. Its multiplicative irrationality exponent ${μ^{\times}} (ξ)$ is the supremum of the real numbers ${μ^{\times}}$ for which the inequality $$ |b ξ- a|_{p} \leq | a b |^{- {μ^{\times}} / 2} $$ has infinitely many solutions in nonzero integers $a, b$. We show that ${μ^{\times}} (ξ)$ can be expressed in terms of a new exponent of approximation attached to a sequence of rational numbers defined in terms of $ξ$. We establish that ${μ^{\times}} ({{ξ_{{\bf t}, p}}}) = 3$, where ${{ξ_{{\bf t}, p}}}$ is the $p$-adic number $1 - p - p^2 + p^…
The level of distribution of a complex valued sequence $b$ measures "how well $b$ behaves" on arithmetic progressions $nd+a$. Determining whether $θ$ is a level of distribution for $b$ involves summing a certain error over $d\leq D$, where $D$ depends on $θ$, this error is given by comparing a finite sum of $b$ along $nd+a$ and the expected value of the sum. We prove that the Thue--Morse sequence has level of distribution $1$, which is essentially best possible. More precisely, this sequence gives one of the first nontrivial examples of a sequence satisfying a Bombieri--Vinogradov type theorem…
Given a real number $τ$, we study the approximation of $τ$ by signed harmonic sums $σ_N(τ) := \sum_{n \leq N}{s_n(τ)}/n$, where the sequence of signs $(s_N(τ))_{N \in\mathbb{N}}$ is defined "greedily" by setting $s_{N+1}(τ) := +1$ if $σ_N(τ) \leq τ$, and $s_{N+1}(τ) := -1$ otherwise. Precisely, we compute the limit points and the decay rate of the sequence $(σ_N(τ)-τ)_{N \in \mathbb{N}}$. Moreover, we give an accurate description of the behavior of the sequence of signs $(s_N(τ))_{N\in\mathbb{N}}$, highlighting a surprising connection with the Thue--Morse sequence.
We consider a Laurent series defined by infinite products $g_u(t) = \prod_{n=0}^\infty (1 + ut^{-2^n})$, where $u\in \mathbb{F}$ is a parameter and $\mathbb{F}$ is a field. We show that for all $u\in\mathbb{Q}\setminus\{-1,0,1\}$ the series $g_u(t)$ does not satisfy the $t$-adic Littlewood conjecture. On the other hand, if $\mathbb{F}$ is finite then $g_u(t)\in \mathbb{F}((t^{-1}))$ is either a rational function or it satisfies the $t$-adic Littlewood conjecture.
The spectrum of a weighted Dirac comb on the Thue-Morse quasicrystal is investigated, and characterized up to a measure zero set, by means of the Bombieri-Taylor conjecture, for Bragg peaks, and of another conjecture that we call Aubry-Godrèche-Luck conjecture, for the singular continuous component. The decomposition of the Fourier transform of the weighted Dirac comb is obtained in terms of tempered distributions. We show that the asymptotic arithmetics of the $p$-rarefied sums of the Thue-Morse sequence (Dumont; Goldstein, Kelly and Speer; Grabner; Drmota and Skalba,...), namely the fractali…
In this article, first we generalize the Thue-Morse sequence $(a(n))_{n=0}^\infty$ (the generalized Thue-Morse sequences) by a cyclic permutation and $k$ -adic expansion of natural numbers, and consider the necessary-sufficient condition that it is non-periodic. Moreover we will show that, if the generalized Thue-Morse sequence is not periodic, then all equally spaced subsequences $(a(N+nl))_{n=0}^\infty$ (where $N \ge 0$ and $l >0$) of the generalized Thue-Morse sequences are not periodic. Finally we apply the criterion of [ABL], [Bu$1$] on transcendental numbers, to find that , for a non per…
We put forward several general conjectures concerning the algebraicity or transcendence of continued fractions and Stieltjes continued fractions defined by the Thue-Morse and period-doubling sequences in characteristic $2$. We present our Guess'n'Prove method, in which we exploit the structure of automata, for proving some of our conjectures in special cases.
In this article we introduce a new approach to compute infinite products defined by automatic sequences involving the Thue-Morse sequence. As examples, for any positive integers $q$ and $r$ such that $0 \leq r \leq q-1$, we find infinitely many couples of rational functions $R(x)$ and $S(n)$ such that $$\prod_{n=0}^{\infty}R(n)^{\frac{1+a_n}{2}}S(n)^{\frac{1-a_n}{2}}=2cos(\frac{2r+1}{2q}π),$$ where $(a_n)_{n \in \mathbf{N}}$ is the Thue-Morse sequence beginning with $a_0=1,a_1= -1$.
We estimate Gowers uniformity norms for some classical automatic sequences, such as the Thue-Morse and Rudin-Shapiro sequences. The methods can also be extended to other automatic sequences. As an application, we asymptotically count arithmetic progressions in the set of integers $\leq N$ where the Thue-Morse (resp. Rudin-Shapiro) sequence takes the value $+1$.
In 1998, Allouche, Peyrière, Wen and Wen established that the Hankel determinants associated with the Thue--Morse sequence on $\{-1, 1\}$ are always nonzero. Their proof depends on a set of sixteen recurrence relations. We present an alternative, purely combinatorial proof of the same result. We also re-prove a recent result of Coons on the non-vanishing of the Hankel determinants associated to two other classical integer sequences.
The set of unique $β$-expansions over the alphabet $\{0,1\}$ is trivial for $β$ below the golden ratio and uncountable above the Komornik-Loreti constant. Generalisations of these thresholds for three-letter alphabets were studied by Komornik, Lai and Pedicini (2011, 2017). We use S-adic words including the Thue-Morse word (which defines the Komornik-Loreti constant) and Sturmian words (which characterise generalised golden ratios) to determine the value of a certain generalisation of the Komornik-Loreti constant to three-letter alphabets.
We prove that the Thue--Morse sequence $\mathbf t$ along subsequences indexed by $\lfloor n^c\rfloor$ is normal, where $1<c<3/2$. That is, for $c$ in this range and for each $ω\in\{0,1\}^L$, where $L\geq 1$, the set of occurrences of $ω$ as a subword (contiguous finite subsequence) of the sequence $n\mapsto \mathbf t_{\lfloor n^c\rfloor}$ has asymptotic density $2^{-L}$. This is an improvement over a recent result by the second author, which handles the case $1<c<4/3$. In particular, this result shows that for $1<c<3/2$ the sequence $n\mapsto \mathbf t_{\lfloor n^c\rfloor}$ attains both of its…
The Thue--Morse sequence is a prototypical automatic sequence found in diverse areas of mathematics, and in computer science. We study occurrences of factors $w$ within this sequence, more precisely, the sequence of gaps between consecutive occurrences. This gap sequence is morphic; we prove that it is not automatic as soon as the length of $w$ is at least two, thereby answering a question by J.~Shallit in the affirmative. We give an explicit method to compute the \emph{discrepancy} of the number of occurrences of the block $\mathtt{01}$ in the Thue--Morse sequence. We prove that the sequence …
Let $t(n)$ denote the number of $1$-bits in the base-$2$ representation of $n$, taken modulo $2$. We show how to prove the classic conjecture of Leo Moser, on the rarefied sum $\sum_{0\leq i<n} (-1)^{t(3i)}$, using tools from automata theory and logic. The same technique can be used to prove results about analogous sums.
Both the Thue-Morse and Rudin-Shapiro sequences are not suitable sequences for cryptography since their expansion complexity is small and their correlation measure of order 2 is large. These facts imply that these sequences are highly predictable despite the fact that they have a large maximum order complexity. Sun and Winterhof (2019) showed that the Thue-Morse sequence along squares keeps a large maximum order complexity. Since, by Christol's theorem, the expansion complexity of this rarefied sequence is no longer bounded, this provides a potentially better candidate for cryptographic applic…
The Stern polynomials defined by $s(0;x)=0$, $s(1;x)=1$, and for $n\geq 1$ by $s(2n;x)=s(n;x^2)$ and $s(2n+1;x)=x\,s(n;x^2)+s(n+1;x^2)$ have only 0 and 1 as coefficients. We construct an infinite lower-triangular matrix related to the coefficients of the $s(n;x)$ and show that its inverse has only 0, 1, and $-1$ as entries, which we find explicitly. In particular, the sign distribution of the entries is determined by the Prouhet-Thue-Morse sequence. We also obtain other properties of this matrix and a related Pascal-type matrix that involve the Catalan, Stirling, Fibonacci, Fine, and Padovan n…
The Hankel determinants of certain automatic sequences $f$ are evaluated, based on a calculation modulo a prime number. In most cases, the Hankel determinants of automatic sequences do not have any closed-form expressions; the traditional methods, such as $LU$-decompo\-si\-tion and Jacobi continued fraction, cannot be applied directly. Our method is based on a simple idea: the Hankel determinants of each sequence $g$ equal to $f$ modulo $p$ are equal to the Hankel determinants of $f$ modulo $p$. The clue then consists of finding a nice sequence $g$, whose Hankel determinants have closed-form e…
Let $t_n = (-1)^{s_2(n)}$, where $s_2(n)$ is the sum of binary digits function. The sequence $(t_n)_{n\in \mathbb N}$ is the well-known Prouhet-Thue-Morse sequence. In this note we initiate the study of the sequence $(h_n)_{n\in \mathbb N}$, where $h_0 = 0, h_1 = $1 and for $n \ge 2$ we define $h_n$ recursively as follows:$ h_n = t_n h_{n-1} + h_{n-2}$. We prove several results concerning arithmetic properties of the sequence $(h_n )_{n\in \mathbb N}$. In particular, we prove non-vanishing of $h_n$ for $n \ge 5$, automaticity of the sequence $(h_n \pmod m)_{n\in \mathbb N}$ for each m, and oth…
Let $s_{k}(n)$ denote the sum of digits of an integer $n$ in base $k$. Motivated by certain identities of Nieto, and Bateman and Bradley involving sums of the form $\sum_{i=0}^{2^{n}-1}(-1)^{s_{2}(i)}(x+i)^{m}$ for $m=n$ and $m=n+1$, we consider the sequence of polynomials \begin{equation*} f_{m,n}^{\mathbf u}(x)=\sum_{i=0}^{k^{n}-1}ζ_{k}^{s_{k}(i)}(x+{\mathbf u}(i))^{m}. \end{equation*} defined for sequences ${\bf u}(i)$ satisfying a certain recurrence relation. We prove that computing these polynomials is essentially equivalent with computing their constant term and we find an explicit formu…
Let (t_n) be the classical Thue-Morse sequence defined by t_n = s_2(n) (mod 2), where s_2 is the sum of the bits in the binary representation of n. It is well known that for any integer k>=1 the frequency of the letter "1" in the subsequence t_0, t_k, t_{2k}, ... is asymptotically 1/2. Here we prove that for any k there is a n<=k+4 such that t_{kn}=1. Moreover, we show that n can be chosen to have Hamming weight <=3. This is best in a twofold sense. First, there are infinitely many k such that t_{kn}=1 implies that n has Hamming weight >=3. Second, we characterize all k where the minimal n equ…
Univoque numbers are real numbers $λ> 1$ such that the number 1 admits a unique expansion in base $λ$, i.e., a unique expansion $1 = \sum_{j \geq 0} a_j λ^{-(j+1)}$, with $a_j \in \{0, 1, ..., \lceil λ\rceil -1\}$ for every $j \geq 0$. A variation of this definition was studied in 2002 by Komornik and Loreti, together with sequences called {\em admissible sequences}. We show how a 1983 study of the first author gives both a result of Komornik and Loreti on the smallest admissible sequence on the set $\{0, 1, >..., b\}$, and a result of de Vries and Komornik (2007) on the smallest univoque numb…
Let $p$ be a prime number and consider a $p$-automatic sequence ${\bf u}=(u_{n})_{n\in\N}$ and its generating function $U(X)=\sum_{n=0}^{\infty}u_{n}X^{n}\in\mathbb{F}_{p}[[X]]$. Moreover, let us suppose that $u_{0}=0$ and $u_{1}\neq 0$ and consider the formal power series $V\in\mathbb{F}_{p}[[X]]$ which is a compositional inverse of $U(X)$, i.e., $U(V(X))=V(U(X))=X$. In this note we initiate the study of arithmetic properties of the sequence of coefficients of the power series $V(X)$. We are mainly interested in the case when $u_{n}=t_{n}$, where $t_{n}=s_{2}(n)\pmod{2}$ and ${\bf t}=(t_{n})_…
One of the fundamental theorems of uniform distribution theory states that the fractional parts of the sequence $(n α)_{n \geq 1}$ are uniformly distributed modulo one (u.d. mod 1) for every irrational number $α$. Another important result of Weyl states that for every sequence $(n_k)_{k \geq 1}$ of distinct positive integers the sequence of fractional parts of $(n_k α)_{k \geq 1}$ is u.d. mod 1 for almost all $α$. However, in this general case it is usually extremely difficult to classify those $α$ for which uniform distribution occurs, and to measure the speed of convergence of the empirical …
Let ${\mathbb F}_q$ be the finite field of $q$ elements, where $q=p^r$ is a power of the prime $p$, and $\left(β_1, β_2, \dots, β_r \right)$ be an ordered basis of ${\mathbb F}_q$ over ${\mathbb F}_p$. For $$ξ=\sum_{i=1}^rx_iβ_i, \quad \quad x_i\in{\mathbb F}_p,$$ we define the Thue-Morse or sum-of-digits function $T(ξ)$ on ${\mathbb F}_q$ by \[ T(ξ)=\sum_{i=1}^{r}x_i.%,\quad ξ=x_1β_1+\cdots +x_rβ_r\in {\mathbb F}_q. \] For a given pattern length $s$ with $1\le s\le q$, a subset ${\cal A}=\{α_1,\ldots,α_s\}\subset {\mathbb F}_q$, a polynomial $f(X)\in{\mathbb F}_q[X]$ of degree $d$ and a vecto…
Studying and comparing arithmetic properties of a given automatic sequence and the sequence of coefficients of the composition inverse of the associated formal power series (the formal inverse of that sequence) is an interesting problem. This problem was studied before for the Thue-Morse sequence. In this paper, we study arithmetic properties of the formal inverses of two sequences closely related to the well-known Baum-Sweet sequence. We give the recurrence relations for their formal inverses and we determine whether the sequences of indices at which these formal inverses take value $0$ and $…
Taking the product of (2n+1)/(2n+2) raised to the power +1 or -1 according to the n-th term of the Thue-Morse sequence gives rise to an infinite product P while replacing (2n+1)/(2n+2) with (2n)/(2n+1) yields an infinite product Q, where P = (1/2)(4/3)(6/5)(7/8)(10/9)... and Q = (2/3)(5/4)(7/6)(8/9)(11/10)... Though it is known that P = 2^{-1/2}, nothing is known about Q. Looking at the corresponding question when the Thue-Morse sequence is replaced by the regular paperfolding sequence, we obtain two infinite products A and B, where A = (1/2)(3/4)(6/5)(7/8)(9/10)... and B = (2/3)(4/5)(7/6)(8/9…
Automatic sequences are not suitable sequences for cryptographic applications since both their subword complexity and their expansion complexity are small, and their correlation measure of order 2 is large. These sequences are highly predictable despite having a large maximum order complexity. However, recent results show that polynomial subsequences of automatic sequences, such as the Thue--Morse sequence, are better candidates for pseudorandom sequences. A natural generalization of automatic sequences are morphic sequences, given by a fixed point of a prolongeable morphism that is not necess…
Let $F(x)=\prod_{n=0}^{\infty}(1-x^{2^{n}})$ be the generating function for the Prouhet-Thue-Morse sequence $((-1)^{s_{2}(n)})_{n\in\N}$. In this paper we initiate the study of the arithmetic properties of coefficients of the power series expansions of the function $$ F_{t}(x)=F(x)^{t}=\sum_{n=0}^{\infty}f_{n}(t)x^{n}. $$ For $t\in\N_{+}$ the sequence $(f_{n}(t))_{n\in\N}$ is the Cauchy convolution of $t$ copies of the Prouhet-Thue-Morse sequence. For $t\in\Z_{<0}$ the $n$-th term of the sequence $(f_{n}(t))_{n\in\N}$ counts the number of representations of the number $n$ as a sum of powers of…
