I am curious about the answer to the question:
Is there a general formula that covers all numeric palindrome that are divisible by 3? If so what is it?
I had this one form $j(10^n+1), j=3,6\ and\ 9$. But it does not yield all.
I also had this one $j(\sum_{k=0}^n10^k)$. But again it does not yield all.
And as the digits of palindrome increases I think more and more forms will be needed.
Can someone help me answerning my question, thanks a lot everyone.