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.

A230255 Emirps whose sum of digits is prime.

This page as a plain text file.
%I A230255 #11 Nov 01 2022 19:47:04
%S A230255 113,157,179,199,311,337,359,733,739,751,937,953,971,991,1031,1033,
%T A230255 1091,1097,1103,1109,1181,1213,1217,1231,1237,1259,1279,1301,1321,
%U A230255 1381,1439,1453,1471,1499,1523,1583,1619,1657,1723,1741,1811,1831,1901,1949,3011,3019
%N A230255 Emirps whose sum of digits is prime.
%H A230255 K. D. Bajpai, <a href="/A230255/b230255.txt">Table of n, a(n) for n = 1..8500</a>
%e A230255 a(6)= 337 is emirp. Sum of digits= 3+3+7= 13 which is prime.
%e A230255 a(11)= 937 is emirp. Sum of digits= 9+3+7= 19 which is prime.
%p A230255 with(StringTools):KD:= proc() local a,b,d; a:=ithprime(n);b:=parse(Reverse(convert(a,string))); d:=add( i,i = convert((a), base, 10))(a);if a<>b and isprime(b) and isprime(d) then return(a):fi; end: seq(KD(),n=1..2000);
%t A230255 Select[Prime[Range[500]],!PalindromeQ[#]&&AllTrue[{IntegerReverse[#],Total[ IntegerDigits[ #]]},PrimeQ]&] (* _Harvey P. Dale_, Nov 01 2022 *)
%Y A230255 Cf. A006567 (emirps: primes whose reversal is different prime).
%Y A230255 Cf. A082806 (palindromic primes: sum of digits is prime).
%Y A230255 Cf. A178092 (emirps: digital sum is emirp).
%K A230255 nonn,base,less
%O A230255 1,1
%A A230255 _K. D. Bajpai_, Oct 14 2013