On the representation of C-recursive integer sequences by arithmetic terms

DOI10.1080/10236198.2025.2530478MaRDI QIDQ6925531zbMATH OpenFDO

Authors Mihai Prunescu, Lorenzo Sauras Altuzarra

Publication date 25 September 2025

Published in Journal of Difference Equations and Applications (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1080/10236198.2025.2530478

Mathematics Subject Classification ID

Recurrences (11B37) Fibonacci and Lucas numbers and polynomials and generalizations (11B39) Linear difference equations (39A06)

Cites work

• 17 lectures on Fermat numbers. From number theory to geometry. With a foreword by Alena Šolcová
• A difference ring theory for symbolic summation
• A mathematical introduction to logic.
• An arithmetic term for the factorial function
• An extension of holonomic sequences: C^2-finite sequences
• Closed Forms: What They Are and Why We Care
• Computational considerations on the representation of number-theoretic functions by arithmetic terms
• From great discoveries in number theory to applications
• Generatingfunctionology
• scientific article; zbMATH DE number 3566917 (Why is no real title available?)
• scientific article; zbMATH DE number 1018349 (Why is no real title available?)
• scientific article; zbMATH DE number 1793700 (Why is no real title available?)
• scientific article; zbMATH DE number 2099087 (Why is no real title available?)
• scientific article; zbMATH DE number 872231 (Why is no real title available?)
• Methods of Solving Number Theory Problems
• On other two representations of the C-recursive integer sequences by terms in modular arithmetic
• On the non-holonomic character of logarithms, powers, and the \(n\)th prime function
• Plain bases for classes of primitive recursive functions
• Solving linear recurrence equations with polynomial coefficients
• The concrete tetrahedron. Symbolic sums, recurrence equations, generating functions, asymptotic estimates
• Unsolved problems in number theory

Cited in

(4)

• Arithmetic terms for sums of multinomial coefficients
• On modular representations of \(\mathrm{C}\)-recursive integer sequences
• A minimal substitution basis for the Kalmár elementary functions
• Arithmetic-term representations for the greatest common divisor

This page was built for publication: On the representation of C-recursive integer sequences by arithmetic terms

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6925531)