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.

A235696 Semiprimes which have one or more occurrences of exactly eight different digits.

This page as a plain text file.
%I A235696 #12 Sep 01 2014 16:32:59
%S A235696 10234569,10234657,10234685,10234687,10234769,10234795,10234859,
%T A235696 10234865,10234879,10234957,10234967,10235469,10235479,10235489,
%U A235696 10235497,10235679,10235689,10235769,10235789,10235798,10235846,10235847,10235879,10235894,10235947,10235986
%N A235696 Semiprimes which have one or more occurrences of exactly eight different digits.
%H A235696 Harvey P. Dale, <a href="/A235696/b235696.txt">Table of n, a(n) for n = 1..1000</a>
%t A235696 Select[Range[10234000,10236000],PrimeOmega[#]==Count[DigitCount[#],0]==2&] (* _Harvey P. Dale_, Sep 01 2014 *)
%o A235696 (PARI)
%o A235696 list(lim)=my(v=List(), t); forprime(p=2, sqrt(lim), t=p; forprime(q=p, lim\t, listput(v, t*q))); vecsort(Vec(v)) \\ From A001358
%o A235696 b=list(1030000); s=[]; for(n=1, #b, if(#vecsort(eval(Vec(Str(b[n]))),,8)==8, s=concat(s, b[n]))); s
%Y A235696 Cf. A235690-A235695.
%Y A235696 Cf. A235154-A235161.
%K A235696 nonn,base
%O A235696 1,1
%A A235696 _Colin Barker_, Jan 14 2014