Year-end appeal: Please make a donation to the OEIS Foundation to support ongoing development and maintenance of the OEIS. We are now in our 61st year, we have over 378,000 sequences, and we’ve reached 11,000 citations (which often say “discovered thanks to the OEIS”).
%I #20 Apr 21 2023 12:47:12
%S 0,11,2,3,1,4,7,6,10,9,5,12,8,18,13,15,14,17,20,23,21,16,19,22,30,25,
%T 27,26,29,24,31,28,33,32,35,36,34,37,39,38,41,42,43,45,47,44,51,40,49,
%U 46,57,50,53,48,59,56,63,52,61,54,67,55,69,58,70,60,71,62,72
%N The digits of a(n) and a(n+1) taken together are the digits of a prime; least permutation of the nonnegative integers with this property.
%C The offset is zero to have a permutation.
%C Sequence A128280 is an "arithmetic" analog, where instead of concatenation of digits, the terms are added.
%C Sequences A228407 and A228410 are the variants where "prime" is replaced by "palindrome".
%H Lars Blomberg, <a href="/A231433/b231433.txt">Table of n, a(n) for n = 0..9999</a>
%H E. Angelini, <a href="http://list.seqfan.eu/oldermail/seqfan/2013-November/011856.html">Two make a prime</a>, Nov 09 2013
%e Start with a(0)=0. The least prime having this digit is 101, so a(1)=11. Since 0 cannot be used any more and 111 is not a prime, the least digit that can be added to get the digits of some prime (namely 211) is a(2)=2, then a(3)=3 yields 23, etc.
%e See also the link to Angelini's post.
%o (PARI) {a=u=0;for(n=1,99,u+=1<<a;print1(a",");for(k=1,9e9,bittest(u,k)&&next;d=Vec(Str(a,k));for(p=0,(#d)!-1, isprime(eval(concat(t=vecextract(d, numtoperm(#d, p)))))&&t[1]>"0"&&(a=k)&&next(3))))}
%K nonn,base
%O 0,2
%A _Eric Angelini_ and _M. F. Hasler_, Nov 09 2013