https://qiitadon.com/@nabetani/112838 の素朴な解答

multi-palidromic-number.hs

import Data.List (unfoldr)
import Data.Tuple (swap)

solve :: Int -> Int
solve n = head $ filter isMultiPalidromic [n..]

isMultiPalidromic :: Int -> Bool
isMultiPalidromic n = countTwo . filter isPalidromic' $ map (`convertRadix` n) [2..n]
    
isPalidromic :: [Int] -> Bool
isPalidromic = (==) <*> reverse

isPalidromic' :: [Int] -> Bool
isPalidromic' ns = length ns > 2 && isPalidromic ns
               
convertRadix :: Int -> Int -> [Int]
convertRadix n = reverse . unfoldr (fmap (swap . (`divMod` n)) . boolToMaybe (== 0))

boolToMaybe p a = if p a then Nothing else Just a                        

countTwo :: [a] -> Bool
countTwo (x1 : x2 : xs) = True
countTwo _ = False