Exact formulas for the number of palindromes in certain arithmetic progressions
From MaRDI portal
Publication:6496977
Authors: Kritkhajohn Onphaeng, Khemaratchatakumthorn Phakhinkon Napp Phunphayap Tammatada, Pongsriiam Prapanpong 
Publication date: 6 May 2024
Published in: Journal of Integer Sequences (Search for Journal in Brave)
Recommendations
Exact enumeration problems, generating functions (05A15) Radix representation; digital problems (11A63)
Cites Work
- Title not available (Why is that?)
- ON "VERY PALINDROMIC" SEQUENCES
- Palindromes in linear recurrence sequences
- On binary palindromes of the form \(10^n\pm 1\)
- Palindromes dans les progressions arithmétiques
- Almost all palindromes are composite.
- Prime divisors of palindromes
- On \(d\)-digit palindromes in different bases: the number of bases is unbounded
- Title not available (Why is that?)
- Every natural number is the sum of forty-nine palindromes
- Every positive integer is a sum of three palindromes
- Sums of Palindromes: an Approach via Automata
- Palindromes in different bases: a conjecture of J. Ernest Wilkins
- Title not available (Why is that?)
- Title not available (Why is that?)
- Longest arithmetic progressions of palindromes
- Exact formulas for the number of palindromes up to a given positive integer
- Reciprocal sum of palindromes
- Analytic Number Theory for Beginners
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)
