The OEIS is supported by the many generous donors to the OEIS Foundation.

 Hints (Greetings from The On-Line Encyclopedia of Integer Sequences!)
 A160337 1 plus primes using only digits {0, 1, 2, 3, 5, 7}. 2
 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 (list; graph; refs; listen; history; text; internal format)
 OFFSET 1,2 LINKS Alois P. Heinz, Table of n, a(n) for n = 1..10000 PROG (C++) #include 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<

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Style Sheet | Transforms | Superseeker | Recents
The OEIS Community | Maintained by The OEIS Foundation Inc.

Last modified July 1 22:23 EDT 2022. Contains 354984 sequences. (Running on oeis4.)