A160337 1 plus primes using only digits {0, 1, 2, 3, 5, 7}.

1, 2, 3, 5, 7, 11, 13, 17, 23, 31, 37, 53, 71, 73, 101, 103, 107, 113, 127, 131, 137, 151, 157, 173, 211, 223, 227, 233, 251, 257, 271, 277, 307, 311, 313, 317, 331, 337, 353, 373, 503, 521, 523, 557, 571, 577, 701, 727, 733, 751, 757, 773, 1013, 1021, 1031

Offset

1,2

Links

Alois P. Heinz, Table of n, a(n) for n = 1..10000

Prog

(C++)
#include <iostream>
using namespace std;
bool isPrime(long n)
{
    if(n==0) return true;
    for(long i = 2; i<=n/2; i++) { if(n%i == 0) return false; }
    return true;
}
bool checkdigit(long n)
{
    long no = n;
    while(no>0)
    {
        long digit = no%10;
        if(digit==0) return false;
        else { if(!isPrime (digit)) return false; }
        no = no/10;
    }
    return true;
}
int main()
{
    long limit = 1000000000; int count =0;
    for(long i=1; i<=limit; i++)
    {
        if(isPrime(i) && checkdigit(i))
        { count++; cout<<i<<endl; }
        if(count == 100) { return 0; }
    }
    return 0;
}
(Python)
from sympy import isprime
def ok(n): return n == 1 or (set(str(n)) <= set("012357") and isprime(n))
print([m for m in range(1032) if ok(m)]) # Michael S. Branicky, Jan 25 2021

Crossrefs

Cf. A012884, A143390.

Sequence in context: A038617 A036962 A350535 * A190222 A012884 A068669

Adjacent sequences: A160334 A160335 A160336 * A160338 A160339 A160340

Keyword

nonn,base

Author

Mohit Singh Kanwal (mohit_kanwal(AT)hotmail.com), May 10 2009

Status

approved