Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A101503
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A101503 Numbers n such that 11*n + 101 is prime. +0
1
0, 6, 10, 12, 16, 28, 30, 40, 42, 46, 52, 58, 60, 66, 76, 88, 90, 100, 102, 108, 118, 126, 130, 132, 136, 138, 142, 160, 168, 172, 180, 192, 208, 210, 216, 220, 222, 228, 238, 240, 250, 256, 258, 268, 276, 280, 282, 292 (list; graph; listen)
OFFSET

1,2

COMMENT

11 is the smallest two-digit prime and 101 is the smallest three-digit prime.

EXAMPLE

If n=0, then 11*0 + 101 = 101 (prime)

If n=6, then 11*6 + 101 = 167 (prime)

If n=60, then 11*60 + 101 = 761 (prime)

MATHEMATICA

Select[Range[0, 300], PrimeQ[11# + 101] &] - Stefan Steinerberger (stefan.steinerberger(AT)gmail.com), Feb 28 2006

CROSSREFS

Cf. A101123, A101086.

Sequence in context: A143958 A063214 A075082 this_sequence A102148 A107407 A119689

Adjacent sequences: A101500 A101501 A101502 this_sequence A101504 A101505 A101506

KEYWORD

nonn

AUTHOR

Parthasarathy Nambi (PachaNambi(AT)yahoo.com), Jan 24 2005

EXTENSIONS

More terms from Stefan Steinerberger (stefan.steinerberger(AT)gmail.com), Feb 28 2006

page 1

Search completed in 0.002 seconds

Lookup | Welcome | Find friends | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Transforms | Puzzles | Hot | Classics
More pages | Superseeker | Maintained by N. J. A. Sloane (njas@research.att.com)

Last modified November 30 22:12 EST 2008. Contains 150989 sequences.


AT&T Labs Research