login
The OEIS Foundation is supported by donations from users of the OEIS and by a grant from the Simons Foundation.

 

Logo

Year-end appeal: Please make a donation to the OEIS Foundation to support ongoing development and maintenance of the OEIS. We are now in our 56th year, we are closing in on 350,000 sequences, and we’ve crossed 9,700 citations (which often say “discovered thanks to the OEIS”).

Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A032692 Exactly 2 digits from {1,2,3,4,5,6,7,8,9} can precede a(n) to form a prime. 1
17, 117, 119, 123, 131, 143, 147, 157, 159, 173, 177, 191, 193, 197, 199, 201, 207, 227, 233, 239, 241, 247, 251, 261, 263, 279, 289, 291, 299, 303, 317, 321, 327, 331, 339, 341, 353, 357, 359, 363, 367, 369, 387, 407, 409, 411, 427, 429, 439, 443, 469 (list; graph; refs; listen; history; text; internal format)
OFFSET

1,1

LINKS

Harvey P. Dale, Table of n, a(n) for n = 1..1000

EXAMPLE

If a(n) = 469 then we find '3'469 and '6'469 to be primes.

MATHEMATICA

Select[Range[500], Count[Table[FromDigits[Join[{n}, IntegerDigits[#]]], {n, 9}], _?PrimeQ]==2&] (* Harvey P. Dale, Aug 27 2017 *)

CROSSREFS

Sequence in context: A196643 A196598 A222370 * A293877 A044349 A044730

Adjacent sequences:  A032689 A032690 A032691 * A032693 A032694 A032695

KEYWORD

nonn,base

AUTHOR

Patrick De Geest, May 15 1998

STATUS

approved

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

License Agreements, Terms of Use, Privacy Policy. .

Last modified December 6 13:45 EST 2021. Contains 349563 sequences. (Running on oeis4.)