The longest palindromic primes of n-digits reproducing the first part of an integer sequence seen in a mural at Oslo Gardermoen airport

palindrome.py

# The longest palindromic primes of n-digits
# reproducing the first part of an integer
# sequence seen in a mural at Oslo Gardermoen
# airport

from urllib.request import urlopen


def main():
    with urlopen('https://oeis.org/A002385/b002385.txt') as response:
        encoding = response.info().get_content_charset()
        primes = [line.decode(encoding).split()[1] for line in response]

    largest_palindromes = {}
    for prime in primes:
        num_digits = len(prime)
        largest_palindromes[num_digits] = int(prime)

    print(largest_palindromes)


if __name__ == '__main__':
    main()

{1: 7, 2: 11, 3: 929, 5: 98689, 7: 9989899, 9: 999727999, 11: 99999199999}