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

 Hints (Greetings from The On-Line Encyclopedia of Integer Sequences!)
 A036937 Smallest n-digit prime containing only digits 2 and 3. 5
 2, 23, 223, 2333, 23333, 222323, 2222333, 22222223, 222323333, 2222232323, 22222222223, 222222333323, 2222222222323, 22222222223323, 222222222332233, 2222222222323223, 22222222222233323, 222222222222233323, 2222222222222233333, 22222222222222232233 (list; graph; refs; listen; history; text; internal format)
 OFFSET 1,1 COMMENTS It is conjectured that such a prime exists for every value of n. LINKS Alois P. Heinz, Table of n, a(n) for n = 1..400 Robert G. Wilson v, Comments and first 121 terms MATHEMATICA Do[p = 2(10^n - 1)/9; k = 0; While[ ! PrimeQ[p], k++; p = FromDigits[ PadLeft[ IntegerDigits[k, 2], n] + 2]]; Print[p], {n, 1, 30}] (* Robert G. Wilson v, Apr 20 2002 *) Table[SelectFirst[FromDigits/@Tuples[{2, 3}, n], PrimeQ], {n, 20}] (* Harvey P. Dale, Nov 07 2021 *) PROG (Python) from sympy import isprime from itertools import product def a(n):   for b in product("01", repeat=n):     m = int("".join(b).replace("0", "2").replace("1", "3"))     if isprime(m): return m   return None print([a(n) for n in range(1, 21)]) # Michael S. Branicky, Feb 23 2021 after Robert G. Wilson v CROSSREFS Cf. A036229, A020458, A036310, A069841. Sequence in context: A069837 A069629 A069614 * A083808 A252016 A037750 Adjacent sequences:  A036934 A036935 A036936 * A036938 A036939 A036940 KEYWORD nonn,base AUTHOR Patrick De Geest, Jan 04 1999 EXTENSIONS Edited by Jon E. Schoenfield, Mar 27 2014 STATUS approved

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 May 19 18:35 EDT 2022. Contains 353847 sequences. (Running on oeis4.)