arXiv (All)
open access
Multiplicative independence in the sequence of $k$-generalized Pell numbers
We study multiplicative dependence between terms of the \(k\)-generalized Pell sequence \((P_n^{(k)})_{n\ge 2-k}\), defined by the linear recurrence \[ P_n^{(k)}=2P_{n-1}^{(k)}+P_{n-2}^{(k)}+\cdots+P_{n-k}^{(k)}, \] with initial conditions \(P_0^{(k)}=\cdots=P_{-(k-2)}^{(k)}=0\) and \(P_1^{(k)}=1\).
Conceptio Open Archive
Analyze & explore related research in Conceptio
Connect this record directly into your research workflow or AI agent. Explore citations across open repositories, query full text, and export structured proof bundles.
This document is indexed with metadata only: full text is not available in the archive for this record. Open the official source ↗
Related documents
- Initial Runs in Integer Compositions: Lambert Series and Generalized Divisor Sums#1104513
- The Jensen--Pólya program and inequalities for arithmetic sequences#1149452
- An Erdős-Wintner theorem for second-order linear recurrent bases#781040
- An Erdős-Wintner theorem for second-order linear recurrent bases#779665
- On the arithmetic exceptionality of bivariate generalized Chebyshev polynomials#355178
Record · ID 1034735
Retrieved via Conceptio: every document is proof-bundled with source, license, and retrieval metadata.
Retrieved via Conceptio: every document is proof-bundled with source, license, and retrieval metadata.
Bring this data into your agent: Connect via MCP or API · 20 free credits to start · no card required
Read the Docs → · View CLI source on GitHub · Conceptio Open Knowledge Archive
Read the Docs → · View CLI source on GitHub · Conceptio Open Knowledge Archive