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.
%I A321367 #27 Dec 14 2018 19:41:36
%S A321367 3,5,7,11,383,38783,12211811221,18345254381,36729292763,70381018307,
%T A321367 1852347432581,1874989894781,115582393285511,164257606752461,
%U A321367 187610727016781,199239838932991,374147565741473,396089252980693,15243433533434251,18741272727214781,32547212721274523
%N A321367 Palindromic primes p such that the highest factor of p+1 is a palindromic prime and the highest factor of p-1 is also a palindromic prime.
%e A321367 383 is in the sequence because the highest factor of 383+1 is 3, which is a palindromic prime and the highest factor of 383-1 is 191, which is a palindromic prime.
%t A321367 Select[Prime@ Range[10^4], AllTrue[{FactorInteger[# - 1][[-1, 1]], #, FactorInteger[# + 1][[-1, 1]]}, And[PrimeQ@ #, PalindromeQ@ #] &] &] (* _Michael De Vlieger_, Nov 13 2018 *)
%o A321367 (PARI) forprime(n=3,10^9,if(Vecrev(digits(n))==digits(n),s=factor(n-1);t=factor(n+1);s=component(s,1);t=component(t,1);s=s[length(s)];t=t[length(t)];if(Vecrev(digits(s))==digits(s),if(Vecrev(digits(t))==digits(t),print1(n," , ")))))
%Y A321367 Cf. A002113, A002385.
%K A321367 nonn,base
%O A321367 1,1
%A A321367 _Paolo Galliani_, Nov 07 2018
%E A321367 a(11)-a(21) from _Giovanni Resta_, Nov 08 2018