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.

A332841 Smaller members of emirp twins that are partial sums of smaller of emirp twins.

This page as a plain text file.
%I A332841 #12 Mar 22 2020 10:08:26
%S A332841 71,18036881674937,159410465301419,178830865466087,1326840443044577,
%T A332841 3800514323991101,7228912129013327,9266843869794767,10342012683888551,
%U A332841 14243165111201909,16576222389380579,16662956005901237,16776177756427421,31392915728722181,31476048510524069,32561876698250297
%N A332841 Smaller members of emirp twins that are partial sums of smaller of emirp twins.
%C A332841 Smaller members of emirp twins that are partial sums of A175215.
%e A332841 71 + 1031 + 1151 + ... + 901814489 = 18036881674937. 71, 1031, 1151, ..., 901814489 are all smaller members of emirp twins and 18036881674937 is a smaller of an emirp twin pair.
%t A332841 s=0; Do[If[Prime[n]-Prime[n-1]==2 && PrimeQ[IntegerReverse[Prime[n]]] && PrimeQ[IntegerReverse[Prime[n-1]]] && !PalindromeQ[Prime[n]] && !PalindromeQ[Prime[n-1]], s=s+Prime[n-1]; If[PrimeQ[s] && PrimeQ[s+2] && PrimeQ[IntegerReverse[s]] && PrimeQ[IntegerReverse[s+2]] && !PalindromeQ[s] && !PalindromeQ[s+2], Print[{Prime[n-1],s}]]], {n,13,10^9}]
%Y A332841 Cf. A006567, A175215.
%K A332841 nonn,base
%O A332841 1,1
%A A332841 _Metin Sariyar_, Feb 26 2020
%E A332841 a(6)-a(16) from _Giovanni Resta_, Feb 26 2020