Squarefree Palindromes Create the shortest function, program, or expression that calculates a sequence of squarefree palindromic numbers.
A squarefree number is one which is not evenly divisible by a square number (i.e. does not contain a repeated prime factor). For example, \$44 = 2^2 \times 11\$ is not squarefree, whereas \$66 = 2\times3\times11\$ is.
You can find a list of the numbers from this link. The list goes as such: 1, 2, 3, 5, 6, 7, 11, 22, 33, 55, 66, 77, 101, 111, 131, 141, 151, 161, 181, 191...
Python 2, 82 75 bytes
n=0
while 1:
 n+=1
 if`n`[::-1]==`n`*all(n%i**2for i in range(2,n)):print n

Try it Online!
If this was a decision problem (54 bytes):
lambda n:`n`[::-1]==`n`*all(n%i**2for i in range(2,n))

Explanation:
`n`[::-1]==`n`                     # If n is a palindrome. `n` is repr(n).
                                   # We check that it's the same
                                   # backwards and forwards.
              *                    # Multiplplying 2 booleans is AND
all(n%i**2for i in range(2,n))     # Check that squares of all #'s &lt; n do not divide n