login
This site is supported by donations to The OEIS Foundation.
Logo

Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A140180 A number n is included if the smallest prime that is congruent to 1 (mod n) is <= the smallest prime that is congruent to -1 (mod n). 2
1, 2, 5, 10, 11, 13, 16, 22, 23, 25, 26, 28, 29, 33, 35, 36, 39, 40, 41, 43, 46, 50, 52, 53, 56, 58, 61, 63, 65, 66, 67, 70, 73, 78, 81, 82, 83, 86, 88, 89, 92, 93, 95, 96, 100, 101, 105, 106, 111, 112, 113, 116, 119, 122, 124, 125, 126, 127, 130, 131, 134, 136, 145 (list; graph; refs; listen; history; internal format)
OFFSET

1,2

LINKS

Diana Mecum, Table of n, a(n) for n = 1..567

EXAMPLE

For n = 1 and 2 the smallest prime that is congruent to 1 (mod n) equals the smallest prime that is congruent to -1 (mod n). For all other n the inequality is strict.

CROSSREFS

Cf. A093868, A140181.

Sequence in context: A144793 A140707 A136817 * A175324 A056704 A163624

Adjacent sequences:  A140177 A140178 A140179 * A140181 A140182 A140183

KEYWORD

nonn

AUTHOR

Leroy Quet May 11 2008

EXTENSIONS

More terms from Diana Mecum (diana.mecum(AT)gmail.com), Jul 04 2008

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Transforms | Puzzles | Hot | Classics
Recent Additions | More pages | Superseeker | Maintained by The OEIS Foundation Inc.

Content is available under The OEIS End-User License Agreement .

Last modified February 15 23:53 EST 2012. Contains 205860 sequences.