cp's OEIS Frontend

This is a front-end for the Online Encyclopedia of Integer Sequences, made by Christian Perfect. The idea is to provide OEIS entries in non-ancient HTML, and then to think about how they're presented visually. The source code is on GitHub.

A242092 Numbers n such that n and the digital reversal of the n-th prime in base 10 have the same distinct prime factors.

This page as a plain text file.
%I A242092 #28 Dec 11 2019 02:24:24
%S A242092 86,1357,24146,1028736826,33667786628,2132089369082
%N A242092 Numbers n such that n and the digital reversal of the n-th prime in base 10 have the same distinct prime factors.
%C A242092 First 3 terms are all products of 2 primes.
%C A242092 a(4) > 10^8. - _Chai Wah Wu_, Aug 15 2014
%C A242092 a(7) > 10^13. - _Giovanni Resta_, Dec 09 2019
%e A242092 86 = 2^1*43^1, the 86th prime is 443 and 344 = 2^3*43^1.
%e A242092 1357 = 59^1*23^1, the 1357th prime is 11213 and 31211 = 59^1*23^2.
%o A242092 (Python)
%o A242092 from sympy import primefactors, prime
%o A242092 A242092 = [n for n in range(1,10**7) if primefactors(n) == primefactors(int(str(prime(n))[::-1]))]
%o A242092 (PARI)
%o A242092 rev(n)=r="";d=digits(n);for(i=1,#d,r=concat(Str(d[i]),r));eval(r)
%o A242092 for(n=1,10^7,p=rev(prime(n));if(omega(n)==omega(p),if(gcd(n,p)==min(n,p),print1(n,", ")))) \\ _Derek Orr_, Aug 14 2014
%Y A242092 Cf. A110751.
%K A242092 nonn,base,more,hard
%O A242092 1,1
%A A242092 _Chai Wah Wu_, Aug 14 2014
%E A242092 a(4)-a(6) from _Giovanni Resta_, Dec 09 2019