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.

A344466 Primes that occur as p + (digit product of p) for p in A092518.

This page as a plain text file.
%I A344466 #11 May 24 2021 00:23:12
%S A344466 29,47,67,107,109,181,251,293,331,347,431,443,457,491,547,593,631,653,
%T A344466 659,673,743,823,827,839,929,971,977,1091,1129,1181,1231,1237,1279,
%U A344466 1321,1327,1423,1433,1447,1471,1483,1493,1499,1553,1559,1579,1601,1777,1823,1867,1871,1951,1993,2113,2137
%N A344466 Primes that occur as p + (digit product of p) for p in A092518.
%C A344466 Terms are unique and in numerical order.
%C A344466 There are terms that correspond to more than one member of A092518, such as 827 = 683+6*8*3 = 743+7*4*3.
%H A344466 Robert Israel, <a href="/A344466/b344466.txt">Table of n, a(n) for n = 1..10000</a>
%e A344466 a(4) = 107 is a term because 83 = A092518(5) and 107 = 83+8*3.
%p A344466 N:= 10000: # to get terms <= N
%p A344466 S:= {}:
%p A344466 p:= 1:
%p A344466 do
%p A344466   p:= nextprime(p);
%p A344466   if p >= N then break fi;
%p A344466   L:= convert(p,base,10);
%p A344466   if member(0,L) then next fi;
%p A344466   q:= p + convert(L,`*`);
%p A344466   if q <= N and isprime(q) then
%p A344466      S:= S union {q};
%p A344466   fi
%p A344466 od:
%p A344466 sort(convert(S,list));
%Y A344466 Cf. A053666, A092518.
%K A344466 nonn,base
%O A344466 1,1
%A A344466 _J. M. Bergot_ and _Robert Israel_, May 20 2021