## Abstract

For an integer q ≥ 2, a q-recursive sequence is defined by recurrence relations on subsequences of indices modulo some powers of q. In this article, q-recursive sequences are studied and the asymptotic behavior of their summatory functions is analyzed. It is shown that every q-recursive sequence is q-regular in the sense of Allouche and Shallit and that a q-linear representation of the sequence can be computed easily by using the coefficients from the recurrence relations. Detailed asymptotic results for q-recursive sequences are then obtained based on a general result on the asymptotic analysis of q-regular sequences.

Three particular sequences are studied in detail: We discuss the asymptotic behavior of the summatory functions of

Stern’s diatomic sequence,

the number of non-zero elements in some generalized Pascal’s triangle and

the number of unbordered factors in the Thue–Morse sequence.

For the first two sequences, our analysis even leads to precise formulæ without error terms.

Three particular sequences are studied in detail: We discuss the asymptotic behavior of the summatory functions of

Stern’s diatomic sequence,

the number of non-zero elements in some generalized Pascal’s triangle and

the number of unbordered factors in the Thue–Morse sequence.

For the first two sequences, our analysis even leads to precise formulæ without error terms.

Original language | English |
---|---|

Pages (from-to) | 2480–2532 |

Number of pages | 53 |

Journal | Algorithmica |

Volume | 84 |

Issue number | 9 |

DOIs | |

Publication status | Published - Sept 2022 |

## Keywords

- Asymptotic analysis
- Digital function
- Dirichlet series
- Pascal’s triangle
- Recurrence relation
- Regular sequence
- Stern’s diatomic sequence
- Summatory function
- Thue–Morse sequence

## ASJC Scopus subject areas

- Applied Mathematics
- Computer Science(all)
- Computer Science Applications

## Fields of Expertise

- Information, Communication & Computing