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.
[ p: p in PrimesUpTo(600) | not 1 in Intseq(p) ]; // Bruno Berselli, Aug 08 2011
Select[Prime[Range[70]], DigitCount[#, 10, 1] == 0 &] (* Vincenzo Librandi, Aug 09 2011 *)
is(n)=if(isprime(n),n=vecsort(eval(Vec(Str(n))),,8);n[1]>1||(!n[1]&&n[2]>1)) \\ Charles R Greathouse IV, Aug 09 2011
is(n)=!vecsearch(vecsort(digits(n)),1) && isprime(n) \\ Charles R Greathouse IV, Oct 03 2012
next_A038603(n)=until((n=nextprime(n+1))==n=next_A052383(n-1),);n \\ Compute least a(k) > n. See A052383. - M. F. Hasler, Jan 14 2020
from sympy import nextprime
i=p=1
while i<=500:
p = nextprime(p)
if '1' not in str(p):
print(str(i)+" "+str(p))
i+=1
# Indranil Ghosh, Feb 07 2017, edited by M. F. Hasler, Jan 15 2020
# See the OEIS Wiki page for more efficient programs. - M. F. Hasler, Jan 14 2020
[ p: p in PrimesUpTo(500) | not 9 in Intseq(p) ]; // Bruno Berselli, Aug 08 2011
Select[Prime[Range[1000]], DigitCount[ # ][[9]] == 0 &] (* Stefan Steinerberger, May 20 2006 *)
lista(nn)=forprime(p=2, nn, if (!vecsearch(vecsort(digits(p),,8), 9), print1(p, ", "));); \\ Michel Marcus, Feb 22 2015
lista(nn) = forprime (p=2, nn, if (vecmax(digits(p)) != 9, print1(p, ", "))); \\ Michel Marcus, Apr 06 2016
next_A038617(n)=until((n=nextprime(n+1))==(n=next_A007095(n-1)), ); n \\ M. F. Hasler, Jan 14 2020
from sympy import isprime
i = 1
while i <= 300:
if "9" not in str(i) and isprime(i):
print(str(i), end=",")
i += 1 # Indranil Ghosh, Feb 07 2017
[n: n in [1..100000000] | Seqint(Sort(&cat[(Intseq(k)): k in Divisors(n)])) eq 987654321] // Jaroslav Krizek, Jun 19 2014
A160402:={}: p:=23456789: while p<=98765432 do d:=convert(p,base,10): ddig:=true: for k from 0 to 9 do if((k<=1 and numboccur(k,d)>0) or (k>=2 and numboccur(k,d)<>1))then ddig:=false:break: fi: od: if(ddig)then A160402:=A160402 union {p}: fi: p:=nextprime(p): od: op(sort(convert(A160402,list))); # Nathaniel Johnston, Jun 24 2011
filter:= proc(n) convert(convert(n,base,10),set) intersect {2,5} = {} end proc:
select(filter, [seq(ithprime(i),i=1..1000)]); # Robert Israel, Mar 26 2023
Select[Prime[Range[100]], AllTrue[IntegerDigits[#], ! MemberQ[{2, 5}, #1] &] &] (* Amiram Eldar, Mar 26 2023 *)
print(list(islice(primes_with("01346789"), 41))) # uses function/imports in A385776. Jason Bard, Jul 20 2025
a(1) = 73 is a prime, and replacing each of its digits by its square yields 499, which is also prime. Neither 73 nor 499 contains digits 0 or 1, so both are Yarborough primes. a(10) = 823 is a prime, and replacing each of its digits by its square gives 6449, another prime. Neither 823 nor 6449 contains digits 0 or 1, so both are Yarborough primes.
k = 2; Select[Prime[Range[1000000]], Min[IntegerDigits[#]] > 1 && Min[IntegerDigits[Flatten[IntegerDigits[(IntegerDigits[#]^k)]]]] > 1 && PrimeQ[FromDigits[Flatten[IntegerDigits[(IntegerDigits[#]^k)]]]] &]
eva(n) = subst(Pol(n), x, 10) is_a106116(n) = ispseudoprime(n) && vecmin(digits(n)) > 1 a048385(n) = my(d=digits(n), e=[]); for(k=1, #d, d[k]=d[k]^2); for(k=1, #d, my(dd=digits(d[k])); for(t=1, #dd, e=concat(e, dd[t]))); eva(e) is(n) = is_a106116(n) && is_a106116(a048385(n)) \\ Felix Fröhlich, Mar 26 2018
a(1) = 23 is a prime, and replacing each of its digits by its cube yields 827, which is also prime. Neither 23 nor 827 contains digits 0 or 1, so both are Yarborough primes. a(4) = 229 is a prime, and replacing each of its digits by its cube gives 88729, which is also prime. Neither 229 nor 88729 contains digits 0 or 1, so both are Yarborough primes. 29 is a Yarborough prime but 8729 = 7 * 29 * 43, so 29 is not in the sequence. 53 is a Yarborough prime; 12527 is also a prime but not a Yarborough prime (contains digit 1). Hence, 53 is not included in this sequence.
k = 3; Select[Prime[Range[10000]], Min[IntegerDigits[#]] > 1 && Min[IntegerDigits[Flatten[IntegerDigits[(IntegerDigits[#]^k)]]]] > 1 && PrimeQ[FromDigits[Flatten[IntegerDigits[(IntegerDigits[#]^k)]]]] &]
Comments