Exact formulas for the number of palindromes in certain arithmetic progressions
From MaRDI portal
Publication:6496977
Recommendations
Cites work
- scientific article; zbMATH DE number 90584 (Why is no real title available?)
- scientific article; zbMATH DE number 718142 (Why is no real title available?)
- scientific article; zbMATH DE number 2123889 (Why is no real title available?)
- scientific article; zbMATH DE number 1391678 (Why is no real title available?)
- Almost all palindromes are composite.
- Analytic Number Theory for Beginners
- Every natural number is the sum of forty-nine palindromes
- Every positive integer is a sum of three palindromes
- Exact formulas for the number of palindromes up to a given positive integer
- Longest arithmetic progressions of palindromes
- ON "VERY PALINDROMIC" SEQUENCES
- On \(d\)-digit palindromes in different bases: the number of bases is unbounded
- On binary palindromes of the form \(10^n\pm 1\)
- Palindromes dans les progressions arithmétiques
- Palindromes in different bases: a conjecture of J. Ernest Wilkins
- Palindromes in linear recurrence sequences
- Prime divisors of palindromes
- Reciprocal sum of palindromes
- Sums of Palindromes: an Approach via Automata
This page was built for publication: Exact formulas for the number of palindromes in certain arithmetic progressions
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6496977)