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.

Showing 1-1 of 1 results.

A036941 Smallest n-digit prime containing only digits 3 and 5, or 0 if no such prime exists.

Original entry on oeis.org

3, 53, 353, 3533, 33353, 333533, 3335533, 33335333, 333535333, 3333353533, 33333353533, 333333533353, 3333333353353, 33333333555553, 333333333353353, 3333333333333533, 33333333333355333, 333333333333353533
Offset: 1

Views

Author

Patrick De Geest, Jan 04 1999

Keywords

Crossrefs

Programs

  • Maple
    A:= proc(n) local j,x,t;
      x:= (10^n-1)/3;
      for t from 1 to 2^n do
        if isprime(x) then return x fi;
        j:= padic:-ordp(t,2);
        x:= x  - (x mod 10^j) + (7 * 10^j-1)/3;
      od:
      0
    end proc:
    seq(A(n),n=1..100); # Robert Israel, Apr 22 2016
  • Mathematica
    Table[SelectFirst[FromDigits/@(Join[#,{3}]&/@Tuples[{3,5},n]),PrimeQ],{n,0,20}](* The program uses the SelectFirst function from Mathematica version 10 *) (* Harvey P. Dale, Oct 07 2014 *)
Showing 1-1 of 1 results.