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.

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).

Original entry on oeis.org

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
Offset: 1

Views

Author

Leroy Quet, May 11 2008

Keywords

Examples

			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

Extensions

More terms from Diana L. Mecum, Jul 04 2008
Showing 1-1 of 1 results.