Exact formulas for the number of palindromes in certain arithmetic progressions
From MaRDI portal
Publication:6496977
Kritkhajohn Onphaeng, Pongsriiam Prapanpong, Khemaratchatakumthorn Phakhinkon Napp Phunphayap Tammatada
Publication date: 6 May 2024
Published in: Journal of Integer Sequences (Search for Journal in Brave)
Exact enumeration problems, generating functions (05A15) Radix representation; digital problems (11A63)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Palindromes in linear recurrence sequences
- On binary palindromes of the form \(10^n\pm 1\)
- Almost all palindromes are composite.
- Longest arithmetic progressions of palindromes
- Prime divisors of palindromes
- Every natural number is the sum of forty-nine palindromes
- ON d-DIGIT PALINDROMES IN DIFFERENT BASES: THE NUMBER OF BASES IS UNBOUNDED
- ON "VERY PALINDROMIC" SEQUENCES
- 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
- Palindromes dans les progressions arithmétiques
- 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