A is an integer that reads the same forwards and backwards. How many positive 3-digit palindromes are multiples of 3?

(111, 141, 171, 222, 252, 282, 303, 333, 363, 393, 414, 444, 474, 525, 555, 585, 606, 636, 666, 696, 717, 747, 777, 828, 858, 888, 909, 939, 969, 999) >>Total = 30 such numbers

9 with all three digits the same

9*9*1=81 ways to choose a two different digit ones.

[The first and last number can be 1,2,3,4,5,6,7,8,9        9 choices

the middle number can be any number, including 0 but not including the number already chosen  9 choices]

So I get 90 ways.