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.

A371361 The first of two consecutive primes p, q such that p, q and p + q are all pandigital.

This page as a plain text file.
%I A371361 #14 Mar 21 2024 17:45:27
%S A371361 10234568791,10234685971,10234756849,10234786589,10234865779,
%T A371361 10235678449,10237845649,10243756981,10245836789,10245936781,
%U A371361 10245968371,10247658389,10247658923,10247685893,10248357659,10248756893,10256734879,10256839447,10256839477,10257384679,10257486913,10258367429,10258367489
%N A371361 The first of two consecutive primes p, q such that p, q and p + q are all pandigital.
%C A371361 The first case where a(n) and a(n+1) are consecutive primes is n = 18.  Thus p = a(18) = 10256839447, q = a(19) = 10256839477 and r = 10256839487 are three consecutive primes with p, q, r, p + q and q + r all pandigital. In addition, p + r = 20513678934 ia pandigital.
%H A371361 Michael S. Branicky, <a href="/A371361/b371361.txt">Table of n, a(n) for n = 1..10000</a> (terms 1..100 from Robert Israel)
%e A371361 a(3) =  10234756849 is a term because it is prime and pandigital, the next prime 10234756859 is also pandigital, and  10234756849 + 10234756859 = 20469513708 is pandigital.
%p A371361 ispd:= proc(n) convert(convert(n,base,10),set) = {$0..9} end proc:
%p A371361 q:=nextprime(10^10): qgood:= false: Res:= NULL: count:= 0:
%p A371361 while count < 25 do
%p A371361   p:= q; pgood:= qgood;
%p A371361   q:= nextprime(p); qgood:= ispd(q);
%p A371361   if pgood and qgood and ispd(p+q) then
%p A371361     Res:= Res, p; count:= count+1;
%p A371361   fi;
%p A371361 od:
%p A371361 Res;
%Y A371361 Cf. A171102, A050288
%K A371361 nonn,base
%O A371361 1,1
%A A371361 _Robert Israel_, Mar 19 2024